Archdeacon, D.; Bonnington, P. and Siran, J.
Halin's theorem for cubic graphs on an annulus.
Discrete Mathematics, 281(1-3) pp. 13–25.
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.
Actions (login may be required)