• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.313-323
• /
• 2007

The equitable total chromatic number ${\chi}_{et}(G)$ of a graph G is the smallest integer ${\kappa}$ for which G has a total ${\kappa}$-coloring such that the number of vertices and edges in any two color classes differ by at most one. In this paper, we determine the equitable total chromatic number of one class of the graphs.