Total Coloring for some classes of Cayley graphs
Shantharam Prajnanaswaroopa, J. Geetha, Kanagasabapathi Somasundaram · arXiv (Cornell University) · 2020
The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromatic number for some classes of Cayley graphs.