Majority choosability of digraphs

zbMath1375.05079arXiv1608.06912MaRDI QIDQ2409821

Jarosław Grytczuk, Marcin Anholcer, Bartłomiej Bosek

Publication date: 16 October 2017

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

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

zbMATH Keywords

graph coloringgraph theorylist coloring

Mathematics Subject Classification ID

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

Related Items

Majority colourings of digraphs ⋮ Linear bound for majority colourings of digraphs ⋮ Majority choosability of countable graphs ⋮ Majority edge-colorings of graphs ⋮ Generalized Majority Colourings of Digraphs ⋮ Majority colorings of sparse digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unfriendly partitions of a graph
• Majority colourings of digraphs
• ON THE TWO-COLOURING OF HYPERGRAPHS