On The Total Coloring of Unicyclic Graph and The Join Graph of Unicyclic Graph and Complete Graph
Pang Xiang-feng · Journal of Hefei University · 2012
In this paper,the total chromatic number of Cn′,Cn′∨Kn,G∨Kn are obtained by using some lemmas of the total coloring of complete graph and inductive method,in which Cn′ is a circle and Kn is a complete graph,and G is a unicyclic graph.Thus,total chromatic number conjecture is verified by this kind of graph.