平面图全染色的一个注记  

A Note on Total Coloring of Planar Graphs

作　　者：李晓东[1] 

机构地区：[1]浙江财经学院数学与统计学院,杭州310018

出　　处：《科技通报》2012年第9期15-19,共5页Bulletin of Science and Technology

摘　　要：全染色是对图的顶点和边同时进行的正常染色。对于平面图的全染色,已经证明的结果有:最大度为7不含k(k∈{3,4,5})-圈的平面图是8全可染的。本文证明了如果G是一个最大度为7的平面图,每一个顶点至多关联一个三角形,那么G也是8全可染的。The total coloring of graph was coloring the vertices and edges simultaneously and properly. For the total coloring of planar graph , it was known that the planar graph with maximum degree 7 and without k （k ∈ {3,4,5} ）-cycles were 8-totally-eolorable. In this paper, it was proved that planar graphs with maximum degree 7 and each vertex of graph incident to at most one 3-cycle were also 8-totally-colorable.

关 键 词：图论 平面图 全色数 

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