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

DOI10.1016/0012-365X(92)90650-5MaRDI QIDQ1198656zbMATHFDO

Authors Reinhard Diestel

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treessurveyinfinite graphsopen problemsendtree- decompositions

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Ends of graphs
• Ends and multi-endings. II
• Infinite connected graphs with no end-preserving spanning trees
• Locally finite graphs with ends: A topological approach. I: Basic theory
• Ends in spanning trees

Cites work

• scientific article; zbMATH DE number 4156464 (Why is no real title available?)
• scientific article; zbMATH DE number 3743278 (Why is no real title available?)
• scientific article; zbMATH DE number 41228 (Why is no real title available?)
• scientific article; zbMATH DE number 48089 (Why is no real title available?)
• scientific article; zbMATH DE number 3542459 (Why is no real title available?)
• A proof of the bounded graph conjecture
• 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 end-faithful spanning trees in infinite graphs
• On spanning trees and \(k\)-connectedness in infinite graphs
• Vertex-transitive graphs and accessibility
• Wurzelbäume und unendliche Wege in Graphen
• Über die Enden diskreter Räume und Gruppen
• Über unendliche Wege in Graphen

Cited in

(19)

• Postscript: ``Endomorphism spectra of graphs [Discrete Mathematics 109 (1992) 45--57]
• End simplicial vertices in path graphs
• Duality theorems for stars and combs I: Arbitrary stars and combs
• On vertex transitive graphs of infinite degree
• Ends in digraphs
• Some results on ends and automorphisms of graphs
• Edge-ends in countable graphs
• Locally finite graphs with ends: A topological approach. II: Applications
• End spaces and tree-decompositions
• Constructing tree-decompositions that display all topological ends
• Spanning trees of countable graphs omitting sets of dominated ends
• Decompositions of infinite graphs. II: Circuit decompositions
• Topological paths, cycles and spanning trees in infinite graphs
• On spanning trees and \(k\)-connectedness in infinite graphs
• On graphs with a metric end space
• Uniform even subgraphs and graphical representations of Ising as factors of i.i.d.
• The endotype of an \((n-3)\)-regular graph of order \(n\)
• Ends, tangles and critical vertex sets
• Approximating infinite graphs by normal trees

This page was built for publication: The end structure of a graph: Recent results and open problems

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