Petruševski–Škrekovski conjecture on odd colorings of planar graphs
Statement
Let be a planar graph. An odd coloring of is a proper vertex coloring such that every non-isolated vertex has a color appearing an odd number of times in its neighborhood; let be the minimum number of colors in such a coloring. Petruševski–Škrekovski conjecture. For every planar graph ,
Petruševski and Škrekovski introduced odd coloring and proved that every planar graph is odd 9-colorable. The conjectured bound 5 remains open.
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.