Degenerate colorings of planar graphs
Statement
A graph is -degenerate if every subgraph of has a vertex of degree .
Conjecture Every simple planar graph has a 5-coloring so that for , the union of any color classes induces a -degenerate graph.
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.