Topological paths, cycles and spanning trees in infinite graphs
Authors:
- Reinhard DiestelRDReinhard Diestel
- Daniela KühnDKDaniela Kühn
- 1 August 2004
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 25 (6) , 835-862
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Infinite Cycles ICombinatorica, 2004
- Graph-theoretical versus topological ends of graphsJournal of Combinatorial Theory, Series B, 2003
- Normal Spanning Trees, Aronszajn Trees and Excluded MinorsJournal of the London Mathematical Society, 2001
- A proof of the bounded graph conjectureInventiones Mathematicae, 1992
- On spanning trees and k-connectedness in infinite graphsJournal of Combinatorial Theory, Series B, 1992
- The end structure of a graph: recent results and open problemsDiscrete Mathematics, 1992
- Infinite connected graphs with no end-preserving spanning treesJournal of Combinatorial Theory, Series B, 1992
- An end-faithful spanning tree counterexampleProceedings of the American Mathematical Society, 1991
- Decomposition of Graphs Into Closed and Endless ChainsProceedings of the London Mathematical Society, 1960
- ber die Enden topologischer R ume und GruppenMathematische Zeitschrift, 1931