Linear bound for majority colourings of digraphs

zbMath1395.05070arXiv1701.05715MaRDI QIDQ1671650

Robert Šámal, Fiachra Knox

Publication date: 7 September 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

digraphscolourings

Mathematics Subject Classification ID

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

Related Items (4)

Majority colourings of digraphs ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Majority choosability of countable graphs ⋮ Majority colorings of sparse digraphs

Cites Work

• Majority choosability of digraphs
• Majority colourings of digraphs
• Generalized Majority Colourings of Digraphs
• Unnamed Item

This page was built for publication: Linear bound for majority colourings of digraphs