Majority choosability of countable graphs

DOI10.1016/j.ejc.2023.103829arXiv2003.02883OpenAlexW3009339632MaRDI QIDQ6181996

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

Publication date: 23 January 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

proper coloringmajority coloring

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On a theorem about vertex colorings of graphs
• Unfriendly partitions of a graph
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• Linear bound for majority colourings of digraphs
• Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
• Majority colorings of sparse digraphs
• Majority choosability of digraphs
• Every rayless graph has an unfriendly partition

This page was built for publication: Majority choosability of countable graphs