Majority colorings of sparse digraphs

DOI10.37236/10067zbMath1465.05057arXiv1911.01954OpenAlexW3166274947MaRDI QIDQ2030755

Yanyan Li

Publication date: 7 June 2021

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

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

zbMATH Keywords

minimum out-degreefractional majority \((2+\varepsilon)\)-coloringmaximum in-degree

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Density (toughness, etc.) (05C42)

Related Items (2)

Combinatorics. Abstracts from the workshop held January 5--11, 2020 ⋮ Majority choosability of countable graphs

Cites Work

• Unnamed Item
• Cycles of length 0 modulo k in directed graphs
• Disjoint directed cycles
• Linear bound for majority colourings of digraphs
• Disjoint cycles of different lengths in graphs and digraphs
• Out-degree reducing partitions of digraphs
• On splitting digraphs
• The dichromatic number of a digraph
• On 2-coloring certain \(k\)-uniform hypergraphs
• Majority choosability of digraphs
• Majority colourings of digraphs
• Splitting digraphs
• List coloring digraphs
• Out‐colourings of digraphs
• Generalized Majority Colourings of Digraphs

This page was built for publication: Majority colorings of sparse digraphs