The end structure of a graph: Recent results and open problems

DOI10.1016/0012-365X(92)90650-5zbMath0780.05012MaRDI QIDQ1198656

Reinhard Diestel

Publication date: 16 January 1993

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

zbMATH Keywords

surveyopen problemsinfinite graphsendspanning treestree- decompositions

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Topological paths, cycles and spanning trees in infinite graphs, Edge-ends in countable graphs, End spaces and tree-decompositions, Duality theorems for stars and combs I: Arbitrary stars and combs, Constructing tree-decompositions that display all topological ends, Uniform even subgraphs and graphical representations of Ising as factors of i.i.d., On vertex transitive graphs of infinite degree, Approximating infinite graphs by normal trees, On spanning trees and \(k\)-connectedness in infinite graphs, Decompositions of infinite graphs. II: Circuit decompositions, Spanning trees of countable graphs omitting sets of dominated ends, Ends in digraphs, On graphs with a metric end space

Cites Work

• A survey on graphs with polynomial growth
• An end-faithful spanning tree counterexample
• End-faithful forests and spanning trees in infinite graphs
• Infinite connected graphs with no end-preserving spanning trees
• On spanning trees and \(k\)-connectedness in infinite graphs
• A proof of the bounded graph conjecture
• Vertex-transitive graphs and accessibility
• Über unendliche Wege in Graphen
• Über die Enden diskreter Räume und Gruppen
• On end-faithful spanning trees in infinite graphs
• Wurzelbäume und unendliche Wege in Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item