论文题目：Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable

论文作者：Cai Jiansheng1, Wang Guanghui 2 & Yan Guiying3,?

论文摘要: The minimum number of colors needed to properly color the vertices and edges of a graph G is called the total chromatic number of G and denoted by _(G). It is shown that if a planar graph G has maximum degree _ > 9, then _ ′′(G) = _ + 1. In this paper, we prove that if G is a planar graph with maximum degree 8 and without intersecting chordal 4-cycles, then ′′(G) = 9.

被接受的期刊名: SCIENCE CHINA Mathematics, January 2012 Vol. 55 No. 1: 1