AbstractWe 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
summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disj...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Settling a problem of Diestel from 1992, we prove that every graph G has a tree-decomposition (T, Pt...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
AbstractThis paper is the second of three parts of a comprehensive survey of a newly emerging field:...
AbstractThis paper aims to give a brief introduction to a set of problems, old and new, concerned wi...
AbstractThis paper is the second of three parts of a comprehensive survey of a newly emerging field:...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
AbstractThis paper is the last part of a comprehensive survey of a newly emerging field: a topologic...
AbstractIn 1964 R. Halin raised the question if every infinite connected graph G has a spanning tree...
This paper is intended as an introductory survey of a newly emerging field: a topological approach t...
summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disj...
summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disj...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Settling a problem of Diestel from 1992, we prove that every graph G has a tree-decomposition (T, Pt...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
We study topological versions of paths, cycles and spanning trees in in-finite graphs with ends that...
AbstractThis paper is the second of three parts of a comprehensive survey of a newly emerging field:...
AbstractThis paper aims to give a brief introduction to a set of problems, old and new, concerned wi...
AbstractThis paper is the second of three parts of a comprehensive survey of a newly emerging field:...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
AbstractThis paper is the last part of a comprehensive survey of a newly emerging field: a topologic...
AbstractIn 1964 R. Halin raised the question if every infinite connected graph G has a spanning tree...
This paper is intended as an introductory survey of a newly emerging field: a topological approach t...
summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disj...
summary:The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disj...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
Settling a problem of Diestel from 1992, we prove that every graph G has a tree-decomposition (T, Pt...