Every rayless graph has an unfriendly partition

DOI10.1016/j.endm.2009.07.045zbMath1273.05153arXiv0901.4858OpenAlexW2950631828MaRDI QIDQ5891221

Reinhard Diestel, Henning Bruhn, Philipp Sprüssel, Angelos Georgakopoulos

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0901.4858

zbMATH Keywords

rayless graphsunfriendly partition

Mathematics Subject Classification ID

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

Related Items (2)

Twins of rayless graphs ⋮ Every rayless graph has an unfriendly partition

Cites Work

• Unnamed Item
• Unnamed Item
• Ein Ordnungsbegriff für Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenhaengende Graphen
• Unfriendly partitions of a graph
• Every rayless graph has an unfriendly partition

This page was built for publication: Every rayless graph has an unfriendly partition