On end-faithful spanning trees in infinite graphs
Published online by Cambridge University Press: 24 October 2008
Extract
Let G be an infinite connected graph. A ray (from ν) in G is a 1-way infinite path in G (with initial vertex ν). An infinite connected subgraph of a ray R ⊂ G is called a tail of R. If X ⊂ G is finite, the infinite component of R\X will be called the tail of R in G\X.
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 107 , Issue 3 , May 1990 , pp. 461 - 473
- Copyright
- Copyright © Cambridge Philosophical Society 1990
References
REFERENCES
- 2
- Cited by