A note on coloring digraphs of large girth

DOI10.1016/j.dam.2020.08.003zbMath1450.05034arXiv2004.01925OpenAlexW3077168630MaRDI QIDQ2004076

Raphael Steiner

Publication date: 14 October 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.01925

zbMATH Keywords

digraphsdichromatic numberdigirth

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Decomposing and colouring some locally semicomplete digraphs ⋮ Four proofs of the directed Brooks' theorem ⋮ Extension of Gyárfás-Sumner conjecture to digraphs

Cites Work

• Unnamed Item
• The \(m\)-degenerate chromatic number of a digraph
• Strengthened Brooks' theorem for digraphs of girth at least three
• Eigenvalues and colorings of digraphs
• The dichromatic number of a digraph
• Coloring tournaments: from local to global
• Subdivisions in digraphs of large out-degree or large dichromatic number
• DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
• Planar Digraphs of Digirth Five Are 2-Colorable
• Acyclic systems of representatives and acyclic colorings of digraphs
• List coloring digraphs
• Perfect Digraphs
• Planar Digraphs of Digirth Four are 2-Colorable