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 条
12345