Total Coloring for some classes of Cayley graphs
Prajnanaswaroopa S, Geetha J, Somasundaram K
TL;DR
This paper investigates the total coloring problem for specific classes of Cayley graphs, providing new results on their total chromatic number in relation to the Total Coloring Conjecture.
Contribution
It determines the total chromatic number for certain classes of Cayley graphs, advancing understanding of total coloring in algebraic graph structures.
Findings
Total chromatic number calculated for specific Cayley graph classes
Supports the Total Coloring Conjecture in these classes
Provides new bounds or exact values for total coloring
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Limits and Structures in Graph Theory