For every large enough Δ, a digraph with bounded geometric-mean degree or bounded out-degree and no large biclique or special directed obstruction is dicolourable with Δ−1 colours.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
$(\Delta-1)$-dicolouring of digraphs
For every large enough Δ, a digraph with bounded geometric-mean degree or bounded out-degree and no large biclique or special directed obstruction is dicolourable with Δ−1 colours.