On 3-colorability of planar graphs without adjacent short cycles

被引：0
|
作者：
YingQian Wang
XiangHua Mao
HuaJing Lu
WeiFan Wang
机构：
[1] Zhejiang Normal University,College of Mathematics, Physics and Information Engineering
[2] Ningbo Dahongying University,College of Basic Science
来源：
Science China Mathematics | 2010年 / 53卷
关键词：
planar graph; coloring; extension; cycle; 05C15; 68R10;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A short cycle means a cycle of length at most 7. In this paper, we prove that planar graphs without adjacent short cycles are 3-colorable. This improves a result of Borodin et al. (2005).
引用
收藏
页码：1129 / 1132
页数：3
相关论文
共 50 条
  • [1] On 3-colorability of planar graphs without adjacent short cycles
    WANG YingQian 1
    2 College of Basic Science
    ScienceChina(Mathematics), 2010, 53 (04) : 1129 - 1132
  • [2] On 3-colorability of planar graphs without adjacent short cycles
    Wang YingQian
    Mao XiangHua
    Lu, HuaJing
    Wang WeiFan
    SCIENCE CHINA-MATHEMATICS, 2010, 53 (04) : 1129 - 1132
  • [3] Distance Constraints on Short Cycles for 3-Colorability of Planar graphs
    Kang, Yingli
    Wang, Yingqian
    GRAPHS AND COMBINATORICS, 2015, 31 (05) : 1497 - 1505
  • [4] Distance Constraints on Short Cycles for 3-Colorability of Planar graphs
    Yingli Kang
    Yingqian Wang
    Graphs and Combinatorics, 2015, 31 : 1497 - 1505
  • [5] The 3-colorability of planar graphs without cycles of length 4, 6 and 9
    Kang, Yingli
    Jin, Ligang
    Wang, Yingqian
    DISCRETE MATHEMATICS, 2016, 339 (01) : 299 - 307
  • [6] On the 3-colorability of planar graphs without 4-, 7-and 9-cycles
    Lu, Huajing
    Wang, Yingqian
    Wang, Weifan
    Bu, Yuehua
    Montassier, Mickael
    Raspaud, Andre
    DISCRETE MATHEMATICS, 2009, 309 (13) : 4596 - 4607
  • [7] Improper colorability of planar graphs without prescribed short cycles
    Wang, Yingqian
    Xu, Jinghan
    DISCRETE MATHEMATICS, 2014, 322 : 5 - 14
  • [8] Planar graphs without normally adjacent short cycles
    Lu, Fangyao
    Rao, Mengjiao
    Wang, Qianqian
    Wang, Tao
    DISCRETE MATHEMATICS, 2022, 345 (10)
  • [9] DP-4-colorability of planar graphs without adjacent cycles of given length
    Liu, Runrun
    Li, Xiangwen
    Nakprasit, Kittikorn
    Sittitrai, Pongpat
    Yu, Gexin
    DISCRETE APPLIED MATHEMATICS, 2020, 277 : 245 - 251
  • [10] On (3,1)*-choosability of planar graphs without adjacent short cycles
    Chen, Min
    Raspaud, Andre
    DISCRETE APPLIED MATHEMATICS, 2014, 162 : 159 - 166
12345