华东师范大学学报(自然科学版) ›› 2011, Vol. 2011 ›› Issue (2): 32-38.

• 论文 • 上一篇    下一篇

最大度是5的可平面图的边染色

倪伟平   

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

Edge colorings of planar graphs with maximum degree five

NI Wei-ping   

  1. Department of Mathematics and Information Science, aozhuang University,Zaozhuang Shandong 277160, China
  • Received:2009-11-01 Revised:2010-02-01 Online:2011-03-25 Published:2011-03-25
  • Contact: NI Wei-ping

摘要: 运用Discharge方法及临界图的一些重要性质证明了: 大度是5且任意一个3-圈与任意一个4-圈不相邻接, 或任意一个3-圈与任意一个5-圈不相邻接的可平面图是第一类图. 从而给出了最大度是5的可平面图是第一类图的2个充分条件.

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

Abstract: By applying a discharging method and using some theorems of critical graphs, we proved that every planar graph G with Δ=5 is of class 1, if any 3-cycle is not adjacent to any 4-cycle or to any 5-cycle in G. Therefore, we concluded two sufficient conditions for planar graph G to be Class 1.

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

中图分类号: