Planar graphs of maximum degree six without 7-cycles are class one

被引:0
|
作者
Huang, Danjun [1 ]
Wang, Weifan [1 ]
机构
[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China
来源
ELECTRONIC JOURNAL OF COMBINATORICS | 2012年 / 19卷 / 03期
关键词
Planar graph; edge coloring; class one; cycle; CLASS-I;
D O I
暂无
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
It is conjectured by Vizing (1965) that every planar graphs graph G with maximum degree 6 <= Delta <= 7 is class one. The case Delta = 7 was confirmed independently by Sanders and Zhao (2001), and by Zhang (2000). In this paper, we prove that every planar graph G with Delta = 6 and without 7-cycles is class one.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] List Edge and List Total Colorings of Planar Graphs without non-induced 7-cycles
    Dong, Aijun
    Liu, Guizhen
    Li, Guojun
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2013, 15 (01): : 101 - 106
  • [22] Total Colorings of Planar Graphs with Maximum Degree Seven and without 3-Cycles Adjacent to 5-Cycles
    Liu, Guangde
    Wang, Bing
    Wu, Jian-liang
    FOUNDATIONS OF INTELLIGENT SYSTEMS (ISKE 2011), 2011, 122 : 335 - +
  • [23] Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
    Chang, Jian
    Wang, Hui-Juan
    Wu, Jian-Liang
    A, Yong-Ga
    THEORETICAL COMPUTER SCIENCE, 2013, 476 : 16 - 23
  • [24] A note on the Three Color Problem on planar graphs without 4-and 5-cycles and without ext-triangular 7-cycles
    Liang, Zuosong
    Xu, Guangjun
    Bai, Chunsong
    DISCRETE MATHEMATICS, 2023, 346 (01)
  • [25] The Linear Arboricity of Planar Graphs with Maximum Degree at least 7
    Chen, Hong-Yu
    Tan, Xiang
    Wu, Jian-Liang
    UTILITAS MATHEMATICA, 2013, 90 : 199 - 218
  • [26] On 3-colorable plane graphs without 5-and 7-cycles
    Xu, Baogang
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2006, 96 (06) : 958 - 963
  • [27] The list linear arboricity of planar graphs with 7-cycles containing at most two chords
    Xu, Renyu
    APPLIED MATHEMATICS AND COMPUTATION, 2019, 363
  • [28] A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES
    Xu, Baogang
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (03) : 347 - 353
  • [29] 2-Distance coloring of a planar graph without 3, 4, 7-cycles
    Yuehua Bu
    Xia Lv
    Journal of Combinatorial Optimization, 2016, 32 : 244 - 259
  • [30] Edge colorings of planar graphs with maximum degree five
    Wu, Jian-Liang
    Wu, Yu-Wen
    ARS COMBINATORIA, 2011, 98 : 183 - 191