Majority colourings of digraphs

zbMath1364.05029arXiv1608.03040MaRDI QIDQ2628255

Stephan Kreutzer, Sang-il Oum, David R. Wood, Dominic van der Zypen, P. D. Seymour

Publication date: 13 June 2017

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

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

zbMATH Keywords

graph theorydigraphsgraph colouringmajority colouring

Mathematics Subject Classification ID

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

Related Items (9)

Combinatorics. Abstracts from the workshop held January 5--11, 2020 ⋮ Linear bound for majority colourings of digraphs ⋮ Majority choosability of digraphs ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Majority edge-colorings of graphs ⋮ Out-degree reducing partitions of digraphs ⋮ Generalized Majority Colourings of Digraphs ⋮ From the 1-2-3 conjecture to the Riemann hypothesis ⋮ Majority colorings of sparse digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint directed cycles
• Bounded degree acyclic decompositions of digraphs.
• Linear bound for majority colourings of digraphs
• Majority choosability of digraphs
• Splitting digraphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Generalized Majority Colourings of Digraphs
• Graph colouring and the probabilistic method

This page was built for publication: Majority colourings of digraphs