具有唯一最大度点的Halin图的全色数

The Total Chromatic Number of Halin Graph with an Unique Major Vertex

本文证明了:对于具有唯一最大度点的Halin图G,有G∈G_T^1={G|x_T(G)=△(G)+1}。这里x_T(G)表示图G的全色数,△(G)表示图G的最大度数。

This paper proved that G(rCr={G |XT(G) =△(G)+1} for Halin Graphs G with an Unique Major vertex, where xr (G) denotes the verdix-edge total chromatic number of G,△(G) denotes maximum degree of Halin graph G.