Halin's Theorem for Cubic Graphs on an Annulus

Dan Archdeacon, C. Paul Bonnington and Jozef Siran


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.

Planar infinite graphs

Math Review Classification
Primary 05C10

Last Updated
5 June 2001

16 pages

This article is available in: