最大度为8不含特定子图的平面图的全染色

Total Coloring of Planar Graph with Maximum Degree 8 and without Specified Subgraph

全染色是对图G的顶点和边同时进行正常染色,至少要用△+1个色才能对图G进行正常全染色.本文运用权转移的方法,证明了最大度为8的不含特定子图的简单平面图是9-全可染的.

Total-coloring of graph G is to color the vertices and the edges of the graph properly. To this end, we must use at least △ ＋ 1 colors to color the graph properly. In this paper, we use discharging method to verify that every simple planar graph with maximum degree 8 and without specified subgraph is 9-totally colorable.