若干联图的均匀全染色(英文)

摘要

The total chromatic number χt(G) of a graph G(V,E) is the minimum number of total independent partition sets of V E, satisfying that any two sets have no common element. If the difference of the numbers of any two total independent partition sets of V E is no more than one, then the minimum number of total independent partition sets of V E is called the equitable total chromatic number of G, denoted by χet(G). In this paper, we have obtained the equitable total chromatic number of Wm Kn, Fm Kn and Sm Kn whi...