3-list-coloring planar graphs of girth 4

被引：2
|
作者：
Guo, Jun-Lin [1 ]
Wang, Yue-Li [1 ]
机构：
[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei, Taiwan
来源：
DISCRETE MATHEMATICS | 2011年 / 311卷 / 06期
关键词：
Choosability; Listing coloring; Planar graphs;
D O I：
10.1016/j.disc.2010.12.003
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In Thomassen (1995) [4], Thomassen proved that planar graphs of girth at least 5 are 3-choosable. In Li (2009)[3], Li improved Thomassen's result by proving that planar graphs of girth 4 with no 4-cycle sharing a vertex with another 4- or 5-cycle are 3-choosable. In this paper, we prove that planar graphs of girth 4 with no 4-cycle sharing an edge with another 4- or 5-cycle are 3-choosable. It is clear that our result strengthens Li's result. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：413 / 417
页数：5
相关论文
共 50 条
  • [41] The Game Coloring Number of Planar Graphs with a Specific Girth
    Nakprasit, Keaitsuda Maneeruk
    Nakprasit, Kittikorn
    GRAPHS AND COMBINATORICS, 2018, 34 (02) : 349 - 354
  • [42] ACYCLIC LIST EDGE COLORING OF PLANAR GRAPHS
    Lai, Hsin-Hao
    Lih, Ko-Wei
    BULLETIN OF THE INSTITUTE OF MATHEMATICS ACADEMIA SINICA NEW SERIES, 2010, 5 (04): : 413 - 436
  • [43] A note on list improper coloring planar graphs
    Lih, KW
    Song, ZM
    Wang, WF
    Zhang, KM
    APPLIED MATHEMATICS LETTERS, 2001, 14 (03) : 269 - 273
  • [44] List strong edge coloring of planar graphs with maximum degree 4
    Chen, Ming
    Hu, Jie
    Yu, Xiaowei
    Zhou, Shan
    DISCRETE MATHEMATICS, 2019, 342 (05) : 1471 - 1480
  • [45] List improper colorings of planar graphs with prescribed girth
    Skrekovski, R
    DISCRETE MATHEMATICS, 2000, 214 (1-3) : 221 - 233
  • [46] Strong edge-coloring for planar graphs with large girth
    Chen, Lily
    Deng, Kecai
    Yu, Gexin
    Zhou, Xiangqian
    DISCRETE MATHEMATICS, 2019, 342 (02) : 339 - 343
  • [47] 2-Distance coloring of planar graphs with girth 5
    Dong, Wei
    Xu, Baogang
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1302 - 1322
  • [48] Acyclic edge coloring of planar graphs with girth at least 5
    Hou, Jianfeng
    Wang, Weitao
    Zhang, Xiaoran
    DISCRETE APPLIED MATHEMATICS, 2013, 161 (18) : 2958 - 2967
  • [49] 2-Distance coloring of planar graphs with girth 5
    Wei Dong
    Baogang Xu
    Journal of Combinatorial Optimization, 2017, 34 : 1302 - 1322
  • [50] Injective-edge-coloring of planar graphs with girth restriction
    Bu, Yuehua
    Wang, Peng
    Zhu, Hongguo
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (05)
12345