Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.disc.2003.09.007 | Discrete Mathematics |
Keywords | DocType | Volume |
Infinite graphs,Accumulation points,Excluded subgraphs,Annulus | Journal | 281 |
Issue | ISSN | Citations |
1 | 0012-365X | 1 |
PageRank | References | Authors |
0.36 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Archdeacon | 1 | 277 | 50.72 |
| C. Paul Bonnington | 2 | 100 | 19.95 |
| Jozef Širáň | 3 | 362 | 54.24 |