Simplicial Decompositions of Infinite Graphs

DOI10.1016/S0167-5060(08)70500-4MaRDI QIDQ4163565zbMATH OpenFDO

Authors Rudolf Halin

Publication date 1978

Published in Advances in Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-5060(08)70500-4

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(18)

• 2-linked graphs
• A proof of the bounded graph conjecture
• Excluding a full grid minor
• Ubiquity and the Farey graph
• Characterising \(k\)-connected sets in infinite graphs
• A unified existence theorem for normal spanning trees
• A simple existence criterion for normal spanning trees
• On end-faithful spanning trees in infinite graphs
• Topological cycle matroids of infinite graphs
• An End-Faithful Spanning Tree Counterexample
• On graphs with a metric end space
• scientific article; zbMATH DE number 561828 (Why is no real title available?)
• Normal Tree Orders for Infinite Graphs
• Duality theorems for stars and combs I: Arbitrary stars and combs
• Duality theorems for stars and combs II: Dominating stars and dominated combs
• A metrization theorem for edge-end spaces of infinite graphs
• A representation theorem for end spaces of infinite graphs
• Quickly proving Diestel's normal spanning tree criterion

This page was built for publication: Simplicial Decompositions of Infinite Graphs

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