Planar graphs without 4,6,8-cycles are 3-colorable  

作　　者：Wei-fan WANG Min CHEN 

机构地区：[1]Department of Mathematics,Zhejiang Normal University,Jinhua 321004,China Department of Mathematics,Zhejiang Normal University,Jinhua 321004,China

出　　处：《Science China Mathematics》2007年第11期1552-1562,共11页中国科学：数学（英文版）

基　　金：This work was supported partially by the National Natural Science Foundation of China (Grant No.10471131);the Natural Science Foundation of Zhejiang Province(Grant No.Y604167)

摘　　要：In this paper we prove that every planar graph without 4,6 and 8-cycles is 3-colorable.In this paper we prove that every planar graph without 4,6 and 8-cycles is 3-colorable.

关 键 词：PLANAR GRAPHS COLORING CYCLE 

分 类 号：N[自然科学总论]