The Two-Colour-Conjecture for oriented planar digraphs
Statement
An oriented digraph is a digraph whose underlying undirected graph is simple, and a digraph is -colourable if its vertices admit a colouring with colours such that every colour class is acyclic.
Two-Colour-Conjecture. Every oriented planar digraph is -colourable.
This is the directed analogue of the Four-Colour Theorem. The conjecture was posed by Erdős and Neumann-Lara, and independently by Skrekovski, and 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.