Abstract
AbstractNeumann‐Lara (1985) and Škrekovski conjectured that every planar digraph with digirth at least three is 2‐colorable, meaning that the vertices can be 2‐colored without creating any monochromatic directed cycles. We prove a relaxed version of this conjecture: every planar digraph of digirth at least five is 2‐colorable. The result also holds in the setting of list colorings.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have