On 3-colorability of planar graphs without adjacent short cycles

查看全文 作　　者：WANG YingQian 1,MAO XiangHua 1,LU HuaJing 2 & WANG WeiFan 1 1 College of Mathematics,Physics and Information Engineering,Zhejiang Normal University,Jinhua 321004,China;2 College of Basic Science,Ningbo Dahongying University,Ningbo 315175,China

出　　处：《Science China Mathematics》索引2010年第53卷第4期,共4页

基　　金：supported by the Natural Science Foundation of Zhejiang Province,China(Grant No.Y6090699);National Natural Science Foundation of China (Grant No.10971198) 摘　　要：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). 关键词：PLANAR GRAPH COLORING EXTENSION CYCLE

相关文献

参考文献（9）
引证文献（4）
耦合文献（0）

参考文献(9)

引证文献(4)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

On 3-colorability of planar graphs without adjacent short cycles

参考文献(9)

引证文献(4)

用户提示