dc.contributor.author |
Pearson, John |
en |
dc.date.accessioned |
2007-07-06T04:30:56Z |
en |
dc.date.available |
2007-07-06T04:30:56Z |
en |
dc.date.issued |
1997 |
en |
dc.identifier |
THESIS 98-069 |
en |
dc.identifier.citation |
Thesis (PhD--Mathematics)--University of Auckland, 1997 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/655 |
en |
dc.description |
Full text is available to authenticated members of The University of Auckland only. |
en |
dc.description.abstract |
This thesis details the use of computational methods to find solutions to and develop theory about three problems in topological graph theory Firstly we compute the Hadwiger number for an infinite class of graphs and use these results to develop the theory of the Hadwiger number of a group. Secondly we present au implementation of the face tracing algorithm that has produced toroidal obstructions on eight and nine vertices. This implementation also produced complete sets of triangulations of the torus on eight and nine vertices. The equivalent problem on the outer-pants surface is solved to provide obstructions on up to 10 vertices and 18 edges to the 3-face vertex cover planar graph problem. |
en |
dc.language.iso |
en |
en |
dc.publisher |
ResearchSpace@Auckland |
en |
dc.relation.ispartof |
PhD Thesis - University of Auckland |
en |
dc.relation.isreferencedby |
UoA9969886414002091 |
en |
dc.rights |
Restricted Item. Available to authenticated members of The University of Auckland. |
en |
dc.rights |
Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.title |
Computational Results in Topological Graph Theory |
en |
dc.type |
Thesis |
en |
thesis.degree.grantor |
The University of Auckland |
en |
thesis.degree.level |
Doctoral |
en |
thesis.degree.name |
PhD |
en |
dc.rights.holder |
Copyright: The author |
en |
dc.identifier.wikidata |
Q111963807 |
|