arXiv Analytics

Sign in

arXiv:2006.07677 [math.CO]AbstractReferencesReviewsResources

Total Coloring for some classes of Circulant graphs

Prajnanaswaroopa S, Geetha J, Somasundaram K

Published 2020-06-13Version 1

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.

Comments: 11 pages
Categories: math.CO, cs.DM, cs.DS
Subjects: 05C15, G.2.2, G.2.1
Related articles: Most relevant | Search more
arXiv:2305.11623 [math.CO] (Published 2023-05-19)
Colorings of some Cayley graphs
arXiv:1402.3635 [math.CO] (Published 2014-02-15)
Degree distributions for a class of Circulant graphs
arXiv:1911.06261 [math.CO] (Published 2019-11-14)
Flexibility and movability in Cayley graphs

Links

Toolbox