Wurzelbäume und unendliche Wege in Graphen
From MaRDI portal
Publication:5567013
DOI10.1002/mana.19690410102zbMath0177.27001OpenAlexW2052803814MaRDI QIDQ5567013
Publication date: 1969
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19690410102
Related Items
Quickly proving Diestel's normal spanning tree criterion ⋮ Fixed finite subgraph theorems in infinite weakly modular graphs ⋮ Fixed elements of infinite trees ⋮ A simple existence criterion for normal spanning trees ⋮ Proof of Halin's normal spanning tree conjecture ⋮ Hamilton-laceable bi-powers of locally finite bipartite graphs ⋮ A refinement of Halin's end-faithful spanning tree theorem ⋮ End spaces and spanning trees ⋮ On end-faithful spanning trees in infinite graphs ⋮ Simplicial decompositions of graphs: A survey of applications ⋮ Countably determined ends and graphs ⋮ End spaces and tree-decompositions ⋮ 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 ⋮ Invariant subsets of scattered trees and the tree alternative property of Bonato and Tardif ⋮ End‐faithful spanning trees in graphs without normal spanning trees ⋮ Reconstruction of infinite locally finite connected graphs ⋮ König's Infinity Lemma and Beth's Tree Theorem ⋮ A unified existence theorem for normal spanning trees ⋮ The homology of a locally finite graph with ends ⋮ An edge-deletion problem for locally finite graphs ⋮ Translations and semi-translations in infinite graphs ⋮ A new obstruction for normal spanning trees ⋮ Some results on ends and automorphisms of graphs ⋮ End-faithful forests and spanning trees in infinite graphs ⋮ The end structure of a graph: Recent results and open problems ⋮ A decomposition of locally finite graphs ⋮ Approximating infinite graphs by normal trees ⋮ A proof of the bounded graph conjecture ⋮ Decompositions of infinite graphs. II: Circuit decompositions ⋮ Edge-disjoint double rays in infinite graphs: a Halin type result ⋮ Some path problems in graph theory ⋮ Normal Tree Orders for Infinite Graphs ⋮ Finite invariant sets in infinite graphs ⋮ Addendum to: ``Hamilton-laceable bi-powers of locally finite bipartite graphs ⋮ Submodular functions and rooted trees ⋮ On graphs with a metric end space
