Countable graphs are majority 3-choosable

DOI10.7151/DMGT.2383MaRDI QIDQ6986000zbMATH OpenFDO

Authors John Haslegrave

Publication date 12 May 2025

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

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

zbMATH Keywords

list colouringmajority colouringunfriendly partition

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Infinite graphs (05C63)

Cites work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Every rayless graph has an unfriendly partition
• Generalized Majority Colourings of Digraphs
• 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?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• Linear bound for majority colourings of digraphs
• Majority choosability of countable graphs
• Majority choosability of digraphs
• Majority coloring of infinite digraphs
• Majority colourings of digraphs
• Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
• Unfriendly partitions of a graph

Cited in

(3)

• Mrs. Correct and majority colorings
• Unfriendly partition conjecture holds for line graphs
• All graphs are majority 3-choosable

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

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