On equitable total coloring of complete r-partite graphs
A. R. Da Silva, Simone Dantas, Diana Sasaki · Matemática Contemporânea · 2017
In 2002, Wang conjectured that the equitable total chromatic number of a graph is either ∆ + 1 or ∆ + 2, where ∆ is the maximum degree of a graph.In this work, we investigate the equitable total coloring of complete r-partite graphs and verify the conjecture for some of these graphs.