Halin's theorem for cubic graphs on an annulus

Dan Archdeacon; Craig Paul Bonnington; Jozef Siran

doi:10.1016/j.disc.2003.09.007

Halin's theorem for cubic graphs on an annulus

Dan Archdeacon, Craig Paul Bonnington, Jozef Siran

Research output: Contribution to journal › Article › Research › peer-review

4 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	13 - 25
Number of pages	13
Journal	Discrete Mathematics
Volume	281
Issue number	1
DOIs	https://doi.org/10.1016/j.disc.2003.09.007
Publication status	Published - 2004
Externally published	Yes

Access to Document

10.1016/j.disc.2003.09.007

Cite this

@article{b60164e8bdf441fc81e8d4726b04c04f,

title = "Halin's theorem for cubic graphs on an annulus",

abstract = "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.",

author = "Dan Archdeacon and Bonnington, \{Craig Paul\} and Jozef Siran",

year = "2004",

doi = "10.1016/j.disc.2003.09.007",

language = "English",

volume = "281",

pages = "13 -- 25",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Halin's theorem for cubic graphs on an annulus

AU - Archdeacon, Dan

AU - Bonnington, Craig Paul

AU - Siran, Jozef

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/1842616040

U2 - 10.1016/j.disc.2003.09.007

DO - 10.1016/j.disc.2003.09.007

M3 - Article

SN - 0012-365X

VL - 281

SP - 13

EP - 25

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

Halin's theorem for cubic graphs on an annulus

Abstract

Access to Document

Other files and links

Cite this