摘要
证明了对于Δ（Ｇ）＝４的任一Ｈａｌｉｎ图Ｇ，都有χｖｅ（Ｇ）＝５，此处Δ（Ｇ）和χｖｅ（Ｇ）分别表示图Ｇ的最大度数和点边全色数；对于Δ（Ｇ）＝３的Ｈａｌｉｎ图Ｇ的点边全色数作了初步的探讨。
In this paper, it is proved that χ ve (G) =5 for any Halin graph G with Δ(G) =4, where Δ(G) and χ ve (G) denote the maximal degree and the total chromatic number of G respectively. In addition, the total chrometic number of Halin graphs G with Δ(G) =3 is also discussed.
基金
国家自然科学基金
关键词
图
染色
点边全色数
HALIN图
graph, colouring, vertex-edge total chromatic number
