Unfriendly partitions for graphs not containing a subdivison of an infinite cycle

DOI10.1007/S00493-015-3261-1zbMath1399.05178OpenAlexW2586933125MaRDI QIDQ1705811

Eli Berger

Publication date: 16 March 2018

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-015-3261-1

zbMATH Keywords

partitionscycle

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Infinite graphs (05C63)

Related Items (1)

Majority choosability of countable graphs

Cites Work

• Unnamed Item
• Unfriendly partitions of a graph
• Excluding Subdivisions of Infinite Cliques
• Every rayless graph has an unfriendly partition

This page was built for publication: Unfriendly partitions for graphs not containing a subdivison of an infinite cycle