Total Coloring for some classes of Cayley graphs
Combinatorics
2023-09-19 v2 Discrete Mathematics
Data Structures and Algorithms
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.
Cite
@article{arxiv.2006.07677,
title = {Total Coloring for some classes of Cayley graphs},
author = {Prajnanaswaroopa S and Geetha J and Somasundaram K},
journal= {arXiv preprint arXiv:2006.07677},
year = {2023}
}
Comments
11 pages