一类高度图的全色数

The total chromatic number of certain graphs

证明了当 n 阶图 G 的最大度 A(G)=n—2且最大度点互不相邻时,图 G的全色数 x_r(G)=A(G)+1.

Let G be a graph of order n.In this paper,we have proved the total chromatic number of G, x_T(G)=Δ(G)+when Δ(G)=n-2and the vertices of maximum degree are not adjacent with each other.