摘要
研究了 3-正则Halin图的剖分图G的全色数 ,证明了 :4≤xT(G) ≤ 5 ,特别是当G的 3-度点彼此不相邻时 ,有xT(G) =4,这里xT(G)
In this paper,we obtained some results about x T(G) for subdivision of 3-regular Halin graphs,and proved that:(i)4≤x T(G)≤5;(ii)x T(G)=4 where all 3-degree vertices of G are independent to each other,where x T(G) denotes the (vertex-edge) total chromatic number of G.
出处
《南华大学学报（理工版）》
2002年第4期43-45,49,共4页
Journal of Nanhua University(Science & Engineering)
关键词
HALIN图
剖分图
全色数
Halin graph
subdivision
(vertex-edge)chromatic number
