dc.contributor.author |
Bonnington, C. Paul |
en |
dc.contributor.author |
Richter, R. Bruce |
en |
dc.date.accessioned |
2009-08-28T03:23:18Z |
en |
dc.date.available |
2009-08-28T03:23:18Z |
en |
dc.date.issued |
2001-08 |
en |
dc.identifier.citation |
Department of Mathematics - Research Reports-472 (2001) |
en |
dc.identifier.issn |
1173-0889 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/5156 |
en |
dc.description.abstract |
Halin's Theorem characterizes those infinite connected graphs that have an embedding in the plane with no accumulation points, by exhibiting the list of excluded subgraphs. We generalize this by obtaining a similar characterization of which infinite connected graphs have an embedding in the plane (and other surfaces) with at most $k$ accumulation points. Thomassen [7] provided a different characterization of those infinite connected graphs that have an embedding in the plane with no accumulation points as those for which the ${bf Z}_2$-vector space generated by the cycles has a basis for which every edge is in at most two members. Adopting the definition that the cycle space is the set of all edge-sets of subgraphs in which every vertex has even degree (and allowing restricted infinite sums), we prove a general analogue of Thomassen's result, obtaining a cycle space characterization of a graph having an embedding in the sphere with $k$ accumulation points. |
en |
dc.publisher |
Department of Mathematics, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Research Reports - Department of Mathematics |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.math.auckland.ac.nz/Research/Reports/view.php?id=472 |
en |
dc.title |
Graphs Embedded in the Plane with Finitely Many Accumulation Points |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::230000 Mathematical Sciences::230100 Mathematics |
en |
dc.rights.holder |
The author(s) |
en |