Planar graphs without 4,6,8-cycles are 3-colorable
Planar graphs without 4,6,8-cycles are 3-colorable作者机构：Department of MathematicsZhejiang Normal UniversityJinhua 321004China Department of MathematicsZhejiang Normal UniversityJinhua 321004China
出 版 物：《Science China Mathematics》 (中国科学：数学（英文版）)
年 卷 期：2007年第50卷第11期
页 面：1552-1562页
核心收录：
基 金：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)
主 题：planar graphs coloring cycle
摘 要：In this paper we prove that every planar graph without 4,6 and 8-cycles is 3-colorable.
维普期刊数据库
同方期刊数据库