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 条
  • [1] On 3-colorable planar graphs without prescribed cycles
    Wang, Weifan
    Chen, Min
    DISCRETE MATHEMATICS, 2007, 307 (22) : 2820 - 2825
  • [2] On 3-colorable planar graphs without short cycles
    Chen, Min
    Wang, Weifan
    APPLIED MATHEMATICS LETTERS, 2008, 21 (09) : 961 - 965
  • [3] Planar graphs without 4,6,8-cycles are 3-colorable
    Wei-fan Wang
    Min Chen
    Science in China Series A: Mathematics, 2007, 50 : 1552 - 1562
  • [4] Planar graphs without 4,6,8-cycles are 3-colorable
    Wei-fan WANG~+ Min CHEN Department of Mathematics
    ScienceinChina(SeriesA:Mathematics), 2007, (11) : 1552 - 1562
  • [5] Planar graphs without 4,6,8-cycles are 3-colorable
    Wang, Wei-fan
    Chen, Min
    SCIENCE IN CHINA SERIES A-MATHEMATICS, 2007, 50 (11): : 1552 - 1562
  • [6] Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph
    Huang, Ziwen
    Yang, Fan
    Zhang, Xiaoxia
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024, 70 (02) : 1723 - 1746
  • [7] Planar graphs without 5-and 7-cycles and without adjacent triangles are 3-colorable
    Borodin, O. V.
    Glebov, A. N.
    Montassier, M.
    Raspaud, A.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2009, 99 (04) : 668 - 673
  • [8] On 3-colorable plane graphs without 5-and 7-cycles
    Xu, Baogang
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (06) : 958 - 963
  • [9] Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
    Borodin, O. V.
    Glebov, A. N.
    Raspaud, A.
    DISCRETE MATHEMATICS, 2010, 310 (20) : 2584 - 2594
  • [10] A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
    Xu, Baogang
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (03) : 347 - 353
12345