Equitable total coloring of Cm□CnCm□Cn

The equitable total chromatic number of a graph GG is the smallest integer kk for which GG has a kk-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 CmCm and CnCn have equitable total 5-coloring for all m≥3m≥3 and n≥3n≥3.