共 50 条
Halin's theorem for cubic graphs on an annulus
被引:3
|作者:
Archdeacon, D
[1
]
Bonnington, CP
Sirán, J
机构:
[1] Univ Vermont, Dept Math & Stat, Burlington, VT 05405 USA
[2] Univ Auckland, Dept Math, Auckland, New Zealand
[3] Slovak Univ Technol Bratislava, Dept Math, Bratislava 281368, Slovakia
关键词:
infinite graphs;
accumulation points;
excluded subgraphs;
annulus;
D O I:
10.1016/j.disc.2003.09.007
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Halin's Theorem characterizes those locally-finite, infinite graphs that embed in the plane without accumulation points by giving a set of six topologically excluded subgraphs. We prove the analogous theorem for cubic graphs that embed in an annulus without accumulation points, finding the complete set of 29 excluded subgraphs. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:13 / 25
页数:13
相关论文