Archdeacon, DanBonnington, C. PaulSiran, Jozef2009-08-282009-08-282001-06Department of Mathematics - Research Reports-464 (2001)1173-0889http://hdl.handle.net/2292/5164Halin'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.https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htmTechnical ReportFields of Research::230000 Mathematical Sciences::230100 MathematicsThe author(s)