Colouring the square of a planar graph
Statement
Conjecture Let be a planar graph of maximum degree . The chromatic number of its square is
- at most if ,
- at most if ,
- at most if .
Record
- Source
- Added
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.