华东师范大学学报(自然科学版) ›› 2010, Vol. 2010 ›› Issue (5): 20-26.

• 应用数学与基础数学 • 上一篇    下一篇

最大度是6不含相邻k-圈的可平面图的边染色

倪伟平   

  1. 枣庄学院 数学与信息科学系, 山东 枣庄 277160
  • 收稿日期:2009-08-01 修回日期:2009-12-01 出版日期:2010-09-25 发布日期:2010-09-25
  • 通讯作者: 倪伟平

Edge coloring of planar graphs for maximum degree six without adjacent k-cycles

NI Wei-ping   

  1. Department of Mathematics and Information Science, Zaozhuang University, Zaozhuang Shandong 277160, China
  • Received:2009-08-01 Revised:2009-12-01 Online:2010-09-25 Published:2010-09-25
  • Contact: NI Wei-ping

PDF

1189

摘要： 运用Discharge方法和临界图性质证明了,最大度是6且任意两个长度至多是6的k-圈不相邻的可平面图是第一类图.

关键词: 平面图, 边染色, 最大度, 圈, 平面图, 边染色, 最大度, 圈

Abstract: By applying discharging method and using the properties of critical graphs, we proved that every simple planar graph G with Delta =6 is of class 1, if any two k-cycles of length at most 6 are not adjacent.

Key words: edge coloring, maximum degree, cycle, planar graph, edge coloring, maximum degree, cycle

中图分类号: