经济数学2002，Vol.19Issue(1)：77-80,4.
最大度不大于5的Halin-图的点强全染色
ON THE VERTEX STRONG TOTAL COLORING OF HALIN GRAPHS WITH △ (G) ≤ 5
摘要
Abstract
A proper k-total coloring f of graph G(V,E) be called a k-vertex strong total coloring of G(V,E)iff for (A)v∈V(G), the elements in N[v] are colored with different colors, where N[v] = {u|uv ∈ V (G)}U{v};and xusT(G)=min{k | there is a k-vertex strong total coloring of G} is called the vertex strong total chromatic number of G. In this paper,we obtain the xusT(G) of Halin graph G(V,E) with △(G≤5) and present a conjecture as follows:If G(V,E) is a graph with the order of each component are at least 6,then xusT(G)≤ △(G)+2,where △(G) is the maximum degree of G.关键词
Halin-图/染色/点强全染色Key words
Halin-graph/coloring/vertex strong total coloring引用本文复制引用
刘林忠,张忠辅..最大度不大于5的Halin-图的点强全染色[J].经济数学,2002,19(1):77-80,4.基金项目
This Research is supported by NSFC of China (No. 19871036) （No. 19871036）
