Neumann-Lara and Š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.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。