On 3-colorability of planar graphs without adjacent short cycles

被引：0
|
作者：
YingQian Wang
XiangHua Mao
HuaJing Lu
WeiFan Wang
机构：
[1] Zhejiang Normal University,College of Mathematics, Physics and Information Engineering
[2] Ningbo Dahongying University,College of Basic Science
来源：
Science China Mathematics | 2010年 / 53卷
关键词：
planar graph; coloring; extension; cycle; 05C15; 68R10;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A short cycle means a cycle of length at most 7. In this paper, we prove that planar graphs without adjacent short cycles are 3-colorable. This improves a result of Borodin et al. (2005).
引用
收藏
页码：1129 / 1132
页数：3
相关论文
共 50 条
12345