The nonexistence conjecture for extremal backbone tree colorings
Statement
Let be a graph with maximum degree , and let be a backbone tree. Write for the minimum number of colors in a -backbone coloring. Extremal tree-coloring conjecture. There is no graph with maximum degree and no backbone tree such that either
or
for some . This concerns whether the upper bounds for backbone tree coloring in maximum-degree-four graphs are best possible; the source presents these extremal cases as unresolved.
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.