🔮
🔮
The Ethereal
Total Coloring for some classes of Cayley graphs
June 13, 2020 · The Ethereal · 🏛 Soft Computing - A Fusion of Foundations, Methodologies and Applications
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Prajnanaswaroopa S, Geetha J, Somasundaram K
arXiv ID
2006.07677
Category
math.CO: Combinatorics
Cross-listed
cs.DM,
cs.DS
Citations
2
Venue
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal