Campos–de Mello total coloring conjecture for powers of cycles
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.