The exceptional-graph conjecture for local antimagic chromatic number
Statement
Let be a graph with pendant vertices and chromatic number satisfying . The graphs , caterpillar graphs in the cited theorem, , and the indicated corona graphs , , and are defined by the displayed exceptional conditions. Exceptional-graph conjecture. All graphs with pendants have , except the following cases: for and ; the caterpillar graphs in Theorem~; under the stated inequalities and congruence condition; and the three stated corona families with their displayed values or lower bound. This is presented as a proposed global classification; no resolution is supplied in the paper.
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.