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


On 3-colorable planar graphs without prescribed cycles
Authors:Weifan Wang  Min Chen
Affiliation:Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China
Abstract:
In this paper we prove that every planar graph without cycles of length 4, 5, 6 and 8 is 3-colorable.
Keywords:Coloring   Planar graph   Cycle
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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