The 4-choosability of plane graphs without 4-cycles

被引：3
|
作者：
Lam, PCB [1 ]
Xu, BG
Liu, JZ
机构：
[1] Hong Kong Baptist Univ, Dept Math, 224 Waterloo Rd, Kowloon, Peoples R China
[2] Shandong Univ, Inst Math, Jinan 250100, Peoples R China
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 1999年 / 76卷 / 01期
关键词：
list coloring; choosability; plane graph; 4-cycle;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph G is called k-choosable if k is a number such that if we give lists of k colors to each vertex of G there is a vertex coloring of G where each vertex receives a color from its own list no matter what the lists: are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosable. (C) 1999 Academic Press.
引用
收藏
页码：117 / 126
页数：10
相关论文
共 50 条
  • [1] Acyclic 4-Choosability of Planar Graphs Without 4-Cycles
    Sun, Yingcai
    Chen, Min
    [J]. CZECHOSLOVAK MATHEMATICAL JOURNAL, 2020, 70 (01) : 161 - 178
  • [2] Acyclic 4-Choosability of Planar Graphs Without 4-Cycles
    Yingcai Sun
    Min Chen
    [J]. Czechoslovak Mathematical Journal, 2020, 70 : 161 - 178
  • [3] 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
    Yang, Fan
    Wang, Yue
    Wu, Jian-Liang
    [J]. DISCRETE MATHEMATICS, 2023, 346 (04)
  • [4] IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Wang, Yingqian
    Xu, Lingji
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2029 - 2037
  • [5] Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
    Borodin, O. V.
    Ivanova, A. O.
    Raspaud, A.
    [J]. DISCRETE MATHEMATICS, 2010, 310 (21) : 2946 - 2950
  • [6] On acyclic 4-choosability of planar graphs without short cycles
    Chen, Min
    Raspaud, Andre
    [J]. DISCRETE MATHEMATICS, 2010, 310 (15-16) : 2113 - 2118
  • [7] Acyclic 4-choosability of planar graphs without intersecting short cycles
    Sun, Yingcai
    Chen, Min
    Chen, Dong
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (01)
  • [8] Acyclic 4-choosability of planar graphs without adjacent short cycles
    Borodin, Oleg V.
    Ivanova, Anna O.
    [J]. DISCRETE MATHEMATICS, 2012, 312 (22) : 3335 - 3341
  • [9] On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
    He, Yanfang
    Chen, Min
    Sun, Yingcai
    [J]. DISCRETE MATHEMATICS, 2021, 344 (08)
  • [10] ACYCLIC 5-CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Borodin, O. V.
    Ivanova, A. O.
    [J]. SIBERIAN MATHEMATICAL JOURNAL, 2011, 52 (03) : 411 - 425
12345