Majority coloring of infinite digraphs

MaRDI QIDQ6621148FDOQ6621148

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Unfriendly partitions of a graph
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Majority choosability of digraphs
• Majority colourings of digraphs
• Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
• Every rayless graph has an unfriendly partition

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)