Campos–de Mello total coloring conjecture for powers of cycles
Let be the th power of the cycle on vertices, with . Its maximum degree is denoted by , and is its total chromatic number.
Campos–de Mello's conjecture. If , then
The source states that the total coloring conjecture has been verified for some even-order powers of cycles and that these graphs admit polynomial-time total colorings, while the displayed classification remains presented as a conjecture. The source gives no resolution status for this classification.
References
2 papers in this index state this conjecture (2018–2021). The statement above is taken from the most recent of them; the others are arXiv:1812.05833.
Source: S. Prajnanaswaroopa, J. Geetha and K. Somasundaram, “Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs”, arXiv:2105.12490 (2021).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.