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