Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Published:2019-03 Issue:3 Volume:342 Page:623-627
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Liu Runrun,Li Xiangwen^ORCID

Funder

NSFC

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference12 articles.

1. Vertex colorings with given colors;Vizing;Metody Diskret. Analiz, Novosibirsk,1976

2. Choosability in graphs;Erdős;Congr. Numer.,1979

3. Correspondence coloring and its application to list-coloring planar graphs without cycles of length 4 to 8;Dvořák;J. Combin. Theory Ser. B,2018

4. The asymptotic behavior of the correspondence chromatic number;Bernshteyn;Discrete Math.,2016

5. A. Bernshteyn, A. Kostochka, Sharp Dirac’s Theorem for DP-critical graphs, arXiv:1609.09122.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A sufficient condition for planar graphs to be DP-4-colorable;Quaestiones Mathematicae;2022-10-07

2. Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable;Mathematics;2022-08-04

3. A Deletion–Contraction Relation for the DP Color Function;Graphs and Combinatorics;2022-07-07

4. Upper bound for DP-chromatic number of a graph;Discrete Applied Mathematics;2022-07

5. Relaxed DP-3-Coloring of Planar Graphs Without Some Cycles;Bulletin of the Malaysian Mathematical Sciences Society;2022-05-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP