Strengthened Brooks' theorem for digraphs of girth at least three
From MaRDI portal
Publication:640457
zbMath1230.05129arXiv1110.4896MaRDI QIDQ640457
Bojan Mohar, Ararat Harutyunyan
Publication date: 18 October 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.4896
Related Items
The \(m\)-degenerate chromatic number of a digraph, Extendiendo un resultado de coloraciones de gráficas a coloraciones de digráficas, Digraphs and Variable Degeneracy, The minimum number of edges in 4-critical digraphs of given order, Two results on the digraph chromatic number, Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring, Coloring digraphs with forbidden cycles, A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth, A note on coloring digraphs of large girth, Hajós and Ore constructions for digraphs, Coloring tournaments: from local to global