Abstract
Neumann-Lara and Skrekovski conjectured that every planar digraph is 2-colourable. We show that this conjecture is equivalent to the more general statement that all oriented K_5-minor-free graphs are 2-colourable.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have