最大次为3且最大次点不相邻的图的全色数

THE TOTAL CHROMATIC NUMBER OF GRAPH G WITH△(G)=3 AND MAXIMUM DEGREE VERTICES PAIRWISE NON─ADJACENT

图Ｇ的全色数ＸＴ（Ｇ）是使得Ｖ（Ｃ）ＵＥ（Ｃ）中相邻或相关联元素均着不同色的最少色数．若Ｇ的最大次点不相邻，△（Ｇ）＝３，则ＸＴ（Ｇ）＝４．

The total chromatic number XT(G)of a graph G is the least number of colors assigned toV(G) UE(G) such that no adjacent or incident elements receive the same color. We provedthat if △G)=3 and maximum degree venices of G are pairwise non-adjacent,then XT(G)=4.