Normal Tree Orders for Infinite Graphs

DOI10.2307/2155004MaRDI QIDQ4316973zbMATH OpenOpenAlexFDO

Authors J.-M. Brochet, Reinhard Diestel

Publication date 19 December 1994

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

zbMATH Keywords

characterizationcohesivenessexpansion treeslinked treenormal treesopen problemspartition trees

Mathematics Subject Classification ID

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

Recommendations

• Normal Spanning Trees, Aronszajn Trees and Excluded Minors
• A new obstruction for normal spanning trees
• A unified existence theorem for normal spanning trees
• A simple existence criterion for normal spanning trees

Cites work

• A proof of the bounded graph conjecture
• Excluding infinite minors
• Gallai-Milgram properties for infinite graphs
• scientific article; zbMATH DE number 3709812 (Why is no real title available?)
• Normal Tree Orders for Infinite Graphs
• Simplicial Decompositions of Infinite Graphs
• The Classification of Finitely Spreading Graphs
• The structure of \(TK_ a\)-free graphs
• Wurzelbäume und unendliche Wege in Graphen
• Zusammenzüge und Unterteilungen von Graphen

Cited in

(11)

• Gallai-Milgram properties for infinite graphs
• Proof of Halin's normal spanning tree conjecture
• A unified existence theorem for normal spanning trees
• Halin's end degree conjecture
• On graphs with a metric end space
• Normal Tree Orders for Infinite Graphs
• Gomory‐Hu trees of infinite graphs with finite total weight
• A new obstruction for normal spanning trees
• Applications of Order Trees in Infinite Graphs
• Halin's end degree conjecture
• A representation theorem for end spaces of infinite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4316973)