A Note on Graphs of Dichromatic Number 2

From MaRDI portal
Publication:4987264




Abstract: Neumann-Lara and v{S}krekovski conjectured that every planar digraph is 2-colourable. We show that this conjecture is equivalent to the more general statement that all oriented K5-minor-free graphs are 2-colourable.










This page was built for publication: A Note on Graphs of Dichromatic Number 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987264)