On 3-colorable planar graphs without cycles of four lengths

被引：7
作者：
Luo, Xiaofang [1 ]
Chen, Min [1 ]
Wang, Weifan [1 ]
机构：
[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2007年 / 103卷 / 04期
基金：
中国国家自然科学基金;
关键词：
planar graph; coloring; cycle; length;
D O I：
10.1016/j.ipl.2007.03.007
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this article we prove that planar graphs without 4-, 6-, 7-, and 8-cycles are 3-colorable. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：150 / 156
页数：7
相关论文
共 50 条
  • [31] 1-planar Graphs without 4-cycles or 5-cycles are 5-colorable
    Song, Li-li
    Sun, Lei
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022, 38 (01): : 169 - 177
  • [32] Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable
    Seog-Jin Kim
    Xiaowei Yu
    Graphs and Combinatorics, 2019, 35 : 707 - 718
  • [33] Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable
    Kim, Seog-Jin
    Yu, Xiaowei
    GRAPHS AND COMBINATORICS, 2019, 35 (03) : 707 - 718
  • [34] On L(p, q)-labelling of planar graphs without cycles of length four
    Hou, Jianfeng
    Jin, Yindong
    Li, Heng
    Miao, Lianying
    Zhao, Qian
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 446
  • [35] Edge choosability of planar graphs without short cycles
    WANG Weifan School of Mathematics and Physics
    Science China Mathematics, 2005, (11) : 1531 - 1544
  • [36] Edge choosability of planar graphs without short cycles
    Weifan Wang
    Science in China Series A: Mathematics, 2005, 48 : 1531 - 1544
  • [37] Edge choosability of planar graphs without short cycles
    Wang, WF
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2005, 48 (11): : 1531 - 1544
  • [38] On 3-choosability of planar graphs without certain cycles
    Zhang, Haihui
    Sun, Zhiren
    INFORMATION PROCESSING LETTERS, 2008, 107 (3-4) : 102 - 106
  • [39] Planar graphs with cycles of length neither 4 nor 7 are (3,0,0)-colorable
    Li, Huihui
    Xu, Jinghan
    Wang, Yingqian
    DISCRETE MATHEMATICS, 2014, 327 : 29 - 35
  • [40] Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable
    Liu, Runrun
    Li, Xiangwen
    Yu, Gexin
    DISCRETE MATHEMATICS, 2016, 339 (02) : 992 - 1003
12345