3-choosability of planar graphs with (≤4)-cycles far apart

被引：7

作者：

Dvorak, Zdenek ^{[1
]}

机构：

[1] Charles Univ Prague, Dept Appl Math, Fac Math & Phys, CR-11800 Prague, Czech Republic

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2014年 / 104卷

关键词：

Planar graphs; List coloring; LIST COLORINGS; GIRTH-5; MAP;

D O I：

10.1016/j.jctb.2013.10.004

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph is k-choosable if it can be colored whenever every vertex has a list of at least k available colors. We prove that if cycles of length at most four in a planar graph G are pairwise far apart, then G is 3-choosable. This is analogous to the problem of Havel regarding 3-colorability of planar graphs with triangles far apart. (C) 2013 Elsevier Inc. All rights reserved.

引用

页码：28 / 59

页数：32

共 50 条

[41] Acyclic 4-choosability of planar graphs without adjacent short cycles
Borodin, Oleg V.
Ivanova, Anna O.
DISCRETE MATHEMATICS, 2012, 312 (22) : 3335 - 3341
[42] Acyclic 5-choosability of planar graphs without 4-cycles
Chen, Min
Wang, Weifan
DISCRETE MATHEMATICS, 2008, 308 (24) : 6216 - 6225
[43] On (3,1)*-choosability of planar graphs without adjacent short cycles
Chen, Min
Raspaud, Andre
DISCRETE APPLIED MATHEMATICS, 2014, 162 : 159 - 166
[44] On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles (vol 110, pg 1084, 2010)
Zhang, Haihui
INFORMATION PROCESSING LETTERS, 2010, 110 (24) : A1 - A1
[45] On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles
Min Chen
Ko-Wei Lih
Weifan Wang
Bulletin of the Malaysian Mathematical Sciences Society, 2018, 41 : 1507 - 1518
[46] Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
Wang, Jihui
Cai, Jiansheng
Ma, Qiaoling
DISCRETE APPLIED MATHEMATICS, 2016, 206 : 215 - 219
[47] A note on edge-choosability of planar graphs without intersecting 4-cycles
Ma Q.
Wang J.
Cai J.
Zhang S.
Journal of Applied Mathematics and Computing, 2011, 36 (1-2) : 367 - 372
[48] On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
He, Yanfang
Chen, Min
Sun, Yingcai
DISCRETE MATHEMATICS, 2021, 344 (08)
[49] On (2, r)-choosability of planar graphs without short cycles
Hou, Jianfeng
Zhu, Hongguo
APPLIED MATHEMATICS AND COMPUTATION, 2023, 444
[50] On Choosability with Separation of Planar Graphs Without Adjacent Short Cycles
Chen, Min
Lih, Ko-Wei
Wang, Weifan
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2018, 41 (03) : 1507 - 1518

← 1 2 3 4 5 →