All graphs are majority 3-choosable

DOI10.7151/DMGT.2612MaRDI QIDQ7262336zbMATH OpenFDO

Authors Jan Ouborny, Max F. Pitz

Publication date 11 June 2026

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2612

zbMATH Keywords

list colouringmajority colouringunfriendly partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Cites work

• Countable graphs are majority 3-choosable
• Every planar graph is 5-choosable
• scientific article; zbMATH DE number 4191687 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• Majority choosability of countable graphs
• Majority colourings of digraphs
• Mrs. Correct and majority colorings
• Set Theory
• Unfriendly partition conjecture holds for line graphs

This page was built for publication: All graphs are majority 3-choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262336)