Coloring distance on planar graphs
Statement
Fix a planar graph and , is it true that the distance between any two proper -colorings of is at most ?
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.