Halin's theorem for cubic graphs on an annulus (Q1827692)

\textit{R. Halin} [Arch. Math. 17, 239--243 (1966; Zbl 0141.40904)] characterized locally finite infinite graphs that can be embedded in the plane without accumulation points. The characterization is given by means of six topologically excluded subgraphs. In this paper, an analogous result is given for embeddings of cubic graphs in the annulus without accumulation points. It turns out that there are 29 excluded subgraphs for this problem. An extension for non-cubic graphs has been obtained by Boza et al. [Embedding graphs without accumulation points in generalized cylinders (unpublished)].