Vertex-distinguishing Total Chromatic Nnumber of S_m×S_n,S_m×F_n and S_m×W_n
Zhang Zhong-fu · Journal of Sichuan Normal University · 2009
A proper total-coloring is called vertex-distinguishing the color-sets of incident vertices and incident edges for different vertices are different. The minimum number of colors of a vertex-distinguishing total-coloring is called the vertex-distinguishing total chromatic number of the graph. In this paper,the vertex-distinguishing total chromatic number of Sm×Sn,Sm×Fn and Sm×Wn are given.