Topological paths, cycles and spanning trees in infinite graphs

被引：44

作者：

Diestel, R ^{[1
]}

Kühn, D ^{[1
]}

机构：

[1] Univ Hamburg, D-20146 Hamburg, Germany

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2004年 / 25卷 / 06期

关键词：

D O I：

10.1016/j.ejc.2003.01.002

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (C) 2003 Published by Elsevier Ltd.

引用

页码：835 / 862

页数：28