Cranston–Kim conjecture on list coloring squares of graphs
Statement
Let be a connected graph with maximum degree . Let be its square, and let denote the list chromatic number of . A Moore graph is a -regular graph on vertices such that .
Cranston–Kim conjecture. If is not a Moore graph, then
The source states that Cranston and Kim proved the conjecture for , while Bonamy and Bousquet proved the full claim in the more general setting of online list coloring.
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.