Wurzelbäume und unendliche Wege in Graphen

Cited In (40)

Fixed elements of infinite trees
Quickly proving Diestel's normal spanning tree criterion
The homology of a locally finite graph with ends
A refinement of Halin's end-faithful spanning tree theorem
Fixed finite subgraph theorems in infinite weakly modular graphs
Approximating infinite graphs by normal trees
Translations and semi-translations in infinite graphs
A simple existence criterion for normal spanning trees
End spaces and tree-decompositions
König's infinity lemma and Beth's tree theorem
Decompositions of infinite graphs. II: Circuit decompositions
Proof of Halin's normal spanning tree conjecture
A decomposition of locally finite graphs
A unified existence theorem for normal spanning trees
The end structure of a graph: Recent results and open problems
End spaces and spanning trees
Finite invariant sets in infinite graphs
Normal Tree Orders for Infinite Graphs
Countably determined ends and graphs
A proof of the bounded graph conjecture
Edge-disjoint double rays in infinite graphs: a Halin type result
Simplicial decompositions of graphs: A survey of applications
On graphs with a metric end space
Some results on ends and automorphisms of graphs
Halin's end degree conjecture
End‐faithful spanning trees in graphs without normal spanning trees
On end-faithful spanning trees in infinite graphs
Applications of Order Trees in Infinite Graphs
Submodular functions and rooted trees
Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif
End-faithful forests and spanning trees in infinite graphs
Duality theorems for stars and combs III: Undominated combs
Duality theorems for stars and combs I: Arbitrary stars and combs
Duality theorems for stars and combs II: Dominating stars and dominated combs
A new obstruction for normal spanning trees
An edge-deletion problem for locally finite graphs
Some path problems in graph theory
Addendum to: ``Hamilton-laceable bi-powers of locally finite bipartite graphs
Reconstruction of infinite locally finite connected graphs
Hamilton-laceable bi-powers of locally finite bipartite graphs

This page was built for publication: Wurzelbäume und unendliche Wege in Graphen

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