一类图的△+2全着色

On the △+2 Total Colouring of a Graph

对一类特殊的图G(V,E),其中△(G)=v—1,v是G的顶点数,△(G)表示G的最大度,证明了全着色猜想成立。

In this paper, we have proved that the total colouring conjecture is true for a graph G(v, E), where △(G)=v-1, △(G) is maximum degree of G, v is vertex number of G.