Planar graphs with cycles of length neither 4 nor 7 are -colorable

详细信息    查看全文

• 作者：Huihui Li ; Jinghan Xu ; Yingqian Wang ; ^{yqwang@zjnu.cn" class="auth_mail}
• 关键词：Planar graph ; Cycle ; Improper coloring
• 刊名：Discrete Mathematics
• 出版年：28 July, 2014
• 年：2014
• 卷：327
• 期：Complete
• 页码：29-35
• 全文大小：393 K

文摘

Let be non-negative integers. A graph is -colorable if the vertex set of can be partitioned into subsets such that the subgraph induced by has maximum degree at most for . It is known that planar graphs with cycles of length neither 4 nor , , are -colorable. In this paper, we show that planar graphs with cycles of length neither 4 nor 7 are also -colorable.