Neumann–Lara's 2-colourability conjecture for planar digraphs
Statement
Let be an oriented planar graph, meaning a planar digraph without directed cycles of length at most . A -colouring of is a function such that the subdigraph induced by the vertices of each colour is acyclic. Neumann–Lara's conjecture. Every oriented planar graph is -colourable. The conjecture was proposed by Neumann–Lara in 1985 and independently by Škrekovski. The paper proves the relaxed version for planar digraphs of digirth at least four, while the case of digirth at least three 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.