Equitable total coloring of Cm Cn

The equitable total chromatic number of a graph G is the smallest integer k for which G has a k-total coloring such that the number of vertices and edges colored with each color differs by at most one. In this paper, we show that the Cartesian product graphs of C"m and C"n have equitable total 5-coloring for all m>=3 and n>=3.