Tree-partitions of infinite graphs

DOI10.1016/0012-365X(91)90436-6zbMath0763.05027MaRDI QIDQ1183985

Rudolf Halin

Publication date: 28 June 1992

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

zbMATH Keywords

infinite graphsquasi-treepseudo-treetree-partitions

Mathematics Subject Classification ID

Trees (05C05) Partitions of sets (05A18)

Related Items (8)

Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ On tree-partitions of graphs ⋮ Minors in graphs of large \(\theta_r\)-girth ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ On the queue-number of graphs with bounded tree-width ⋮ On tree-partition-width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A problem in infinite graph-theory
• Parallel concepts in graph theory
• Über unendliche Wege in Graphen

This page was built for publication: Tree-partitions of infinite graphs