Eulerian Neumann-Lara conjecture for oriented planar graphs
Statement
Let be an Eulerian oriented planar graph, meaning a connected oriented planar graph in which every vertex has even degree. A vertex set is acyclic when it induces a subdigraph without directed cycles. Eulerian Neumann-Lara conjecture. The vertices of can be partitioned into two acyclic sets. This is described as the largest open common special case of related Hamiltonicity and dicoloring conjectures, 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.