Total Coloring for some classes of Cayley graphs
arXiv:2006.07677 · doi:10.1007/s00500-023-08752-2
Abstract
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.
11 pages