Archdeacon, D.; Bonnington, P. and Siran, J.
|DOI (Digital Object Identifier) Link:||http://dx.doi.org/10.1016/j.disc.2003.09.007|
|Google Scholar:||Look up in Google Scholar|
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.
|Item Type:||Journal Article|
|Keywords:||Infinite graphs; Accumulation points; Excluded subgraphs; Annulus|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
|Depositing User:||Jozef Širáň|
|Date Deposited:||14 Jun 2007|
|Last Modified:||14 Jan 2016 16:32|
|Share this page:|