A Note on Graphs of Dichromatic Number 2

DOI10.23638/DMTCS-22-4-11MaRDI QIDQ4987264zbMATH OpenOpenAlexFDO

Authors

Publication date 3 May 2021

Full work available at URL https://arxiv.org/abs/1907.00351, https://dmtcs.episciences.org/7040

zbMATH Keywords

directed graphsplanar graphsacyclic colouringdichromatic numberK5-minor-free graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

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 $K_5$-minor-free graphs are $2$-colourable.

Cited in

(2)

• A note on 2-distance chromatic numbers of graphs
• Four proofs of the directed Brooks' theorem

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)