首页 | 本学科首页   官方微博 | 高级检索  
     


Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Authors:Yuehua Bu  Weifan Wang
Affiliation:a Department of Mathematics, Shanghai University, Shanghai 200436, PR China
b Department of Mathematics, Zhejiang Normal University, Jinhua 321004, PR China
Abstract:
Let G be a planar graph of maximum degree 6. In this paper we prove that if G does not contain either a 6-cycle, or a 4-cycle with a chord, or a 5- and 6-cycle with a chord, then χ(G)=6, where χ(G) denotes the chromatic index of G.
Keywords:Planar graph   Edge coloring   Chromatic index
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号