Title of article
Topological paths, cycles and spanning trees in infinite graphs
Author/Authors
Diestel، نويسنده , , Reinhard and Kühn، نويسنده , , Daniela، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
28
From page
835
To page
862
Abstract
We study topological versions of paths, cycles and spanning trees in infinite graphs with ends that allow more comprehensive generalizations of finite results than their standard notions. For some graphs it turns out that best results are obtained not for the standard space consisting of the graph and all its ends, but for one where only its topological ends are added as new points, while rays from other ends are made to converge to certain vertices.
Journal title
European Journal of Combinatorics
Serial Year
2004
Journal title
European Journal of Combinatorics
Record number
1549462
Link To Document