End-faithful forests and spanning trees in infinite graphs
From MaRDI portal
Publication:1191930
DOI10.1016/0012-365X(91)90345-3zbMath0763.05034MaRDI QIDQ1191930
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
05C05: Trees
Related Items
The end structure of a graph: Recent results and open problems, Spanning trees of countable graphs omitting sets of dominated ends, Edge-ends in countable graphs, Decompositions of infinite graphs. II: Circuit decompositions, End-Faithful Spanning Trees of Countable Graphs with Prescribed Sets of Rays, Multi-Faithful Spanning Trees of Infinite Graphs
Cites Work
- An end-faithful spanning tree counterexample
- Über unendliche Wege in Graphen
- A refinement of Halin's end-faithful spanning tree theorem
- On end-faithful spanning trees in infinite graphs
- Développments terminaux des graphes infinis III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoints de rayons
- Wurzelbäume und unendliche Wege in Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item