Equitable Total Coloring of Graph S_n+F_n and Graph S_n+W_n
Zhang Zhong-fu · Journal of Wenzhou University · 2009
A proper k-total coloring f of G(V,E) is said to be a k-equitable total coloring of graph G(V,E),if the number of vertices and edges in any two color classes is differed by at most one and the condition of χet(G)=min{k|G has a k-equitable total coloring} is satisfied,it is called the equitable total chromatic number of G.Some results about the equitable total chromatic number of graph Sn+Fn and graph Sn+Wn are presented in this paper.