Generalized Majority Colourings of Digraphs

DOI10.1017/S096354831700044XzbMath1373.05066arXiv1701.03780OpenAlexW3102625287MaRDI QIDQ5373832

Kamil Popielarz, António Girão, Teeradej Kittipassorn

Publication date: 27 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (4)

Majority colourings of digraphs ⋮ Linear bound for majority colourings of digraphs ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Majority colorings of sparse digraphs

Cites Work

• Majority choosability of digraphs
• Majority colourings of digraphs
• Splitting digraphs
• Unnamed Item

This page was built for publication: Generalized Majority Colourings of Digraphs