05732782

j

05732782 Ma, Gang Ma, Ming Zhang, Zhongfu On the equitable total coloring of double graph of some graphs. J. Math. Study 42, No. 1, 40-44 (2009). 2009 Institute of Mathematics, Xiamen University, Xiamen EN double graph equitable total coloring equitable total chromatic number Summary: A proper total-coloring of graph $G$ is said to be equitable if the number of elements (vertices and edges) in any two color classes differ by at most one, the required minimum number of colors of which is called the equitable total chromatic number. In this paper, we derive the equitable total chromatic numbers of double graphs of star, fan and wheel.