Majority coloring of infinite digraphs

MaRDI QIDQ6621148zbMATH OpenFDO

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

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Majority choosability of countable graphs
• Majority colorings of sparse digraphs
• Majority colourings of digraphs
• Majority choosability of digraphs
• Generalized Majority Colourings of Digraphs

Cites work

• scientific article; zbMATH DE number 4191687 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• Every rayless graph has an unfriendly partition
• Majority choosability of digraphs
• Majority colourings of digraphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
• Unfriendly partitions of a graph

Cited in

(1)

• Majority choosability of countable graphs

This page was built for publication: Majority coloring of infinite digraphs

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