A Few Theorems of Total Coloring of Graphs
Xiao Li · Harbin Ligong Daxue xuebao · 2001
Total colouring of graph is the important part of colouring problem. The total col.. ouring conjecture f if G is a simple, then XT(G) ≤A(G) +2 is a unsolved problem. This paper proves that the total coloring conjecture is true for some special graphs.