The six-color conjecture for recoloring planar graphs of girth at least five
Statement
Let be a planar graph of girth at least five on vertices. The graph is the reconfiguration graph whose vertices are proper -colorings of , with edges joining colorings that differ on one vertex.
Six-color conjecture. has diameter .
Planar graphs of girth at least five are colorable from lists of size three, and the paper explains that seven colors already suffice by a simpler argument. The conjectured bound improves this to six colors; no resolution is given in the supplied text.
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.