|
|||||
|
|
On 3-colorability of planar graphs without adjacent short cycles |
|
| Authors: | WANG YingQian MAO XiangHua LU HuaJing & WANG WeiFan College of Mathematics Physics Information Engineering Zhejiang Normal University Jinhua China College of Basic Science Ningbo Dahongying University Ningbo |
| Affiliation: | WANG YingQian 1,MAO XiangHua 1,LU HuaJing 2 & WANG WeiFan 1 1 College of Mathematics,Physics , Information Engineering,Zhejiang Normal University,Jinhua 321004,China,2 College of Basic Science,Ningbo Dahongying University,Ningbo 315175 |
| Abstract: | 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). |
| Keywords: | planar graph coloring extension cycle |
| 本文献已被 CNKI 等数据库收录！ | |