The Open UniversitySkip to content

Halin's theorem for cubic graphs on an annulus

Archdeacon, D.; Bonnington, P. and Siran, J. (2004). Halin's theorem for cubic graphs on an annulus. Discrete Mathematics, 281(1-3) pp. 13–25.

DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


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.

Item Type: Journal Article
ISSN: 0012-365X
Keywords: Infinite graphs; Accumulation points; Excluded subgraphs; Annulus
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
Item ID: 8087
Depositing User: Jozef Širáň
Date Deposited: 14 Jun 2007
Last Modified: 14 Jan 2016 16:32
Share this page:


Scopus Citations

▼ Automated document suggestions from open access sources

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340