Normal Tree Orders for Infinite Graphs

DOI10.2307/2155004zbMath0814.05029OpenAlexW4255057301MaRDI QIDQ4316973

Reinhard Diestel, J.-M. Brochet

Publication date: 19 December 1994

Full work available at URL: https://doi.org/10.2307/2155004

zbMATH Keywords

characterizationopen problemscohesivenesspartition treesexpansion treesnormal treeslinked tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Ordinal and cardinal numbers (03E10)

Related Items (7)

Proof of Halin's normal spanning tree conjecture ⋮ A unified existence theorem for normal spanning trees ⋮ Halin's end degree conjecture ⋮ A new obstruction for normal spanning trees ⋮ Gallai-Milgram properties for infinite graphs ⋮ Normal Tree Orders for Infinite Graphs ⋮ On graphs with a metric end space

Cites Work

• Unnamed Item
• Gallai-Milgram properties for infinite graphs
• Excluding infinite minors
• The structure of \(TK_ a\)-free graphs
• A proof of the bounded graph conjecture
• The Classification of Finitely Spreading Graphs
• Simplicial Decompositions of Infinite Graphs
• Normal Tree Orders for Infinite Graphs
• Zusammenzüge und Unterteilungen von Graphen
• Wurzelbäume und unendliche Wege in Graphen

This page was built for publication: Normal Tree Orders for Infinite Graphs