平面图3-可着色的3个充分条件  

Three Sufficient Conditions for Planar Graphs to be 3-Colorable

作　　者：彩春丽[1] 谢德政[1] 

机构地区：[1]重庆大学数学与统计学院,重庆401331

出　　处：《河南师范大学学报（自然科学版）》2011年第6期4-6,28,共4页Journal of Henan Normal University(Natural Science Edition)

基　　金：重庆市科委自然科学基金(CSTC;2007BB2123)

摘　　要：平面图3-可着色是指可用3种颜色对该图的顶点进行着色,使得相邻的顶点着不同的颜色.研究了平面图在长度不大于6的圈或长度不大于7的圈之间满足一定条件下是3-可着色的.A planar graph is 3-colorable if its vertices can be colored with three colors, no two adjacent vertices coloring the same color. It has studied that planar graphs which can be 3-colorable provided that the cycles of length at most 6 or 7 which satisfy some conditions.

关 键 词：平面图 圈 距离 3-可着色 

分 类 号：O157.5[理学—数学]