dc.contributor.advisor |
Paul Bonnington |
en |
dc.contributor.advisor |
Margaret Morton |
en |
dc.contributor.advisor |
Marston Conder |
en |
dc.contributor.author |
Sneddon, Jamie David |
en |
dc.date.accessioned |
2007-05-24T22:58:07Z |
en |
dc.date.available |
2007-05-24T22:58:07Z |
en |
dc.date.issued |
2004 |
en |
dc.identifier.citation |
Thesis (PhD--Mathematics)--University of Auckland, 2004. |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/441 |
en |
dc.description.abstract |
Embedding graphs in surfaces is the central concept of topological graph theory.
Classifying embeddability of graphs is motivated by Kuratowski’s Theorem and
Robertson-Seymour theory, which confirms that the set of obstructions to embeddability
in an arbitrary surface is finite.
We consider embedding directed graphs in surfaces, with restrictions on the direction
of arcs in the local rotation at each vertex. Clustered planar digraphs have
planar embeddings in which, at each vertex, all of the in-arcs occur sequentially
in the local rotation. Three different variations of minors are presented, each of
which produces a finite set of obstructions to clustered planarity. These variations
include new operations on digraphs, and measures which refine the partial
ordering.
Tournaments are digraphs with exactly one edge between every distinct pair of
vertices. The domination graph of a tournament is a graph with the same vertices,
and an edge between two of the vertices if every other vertex is beaten by one of
those two vertices. We present two variations of domination graphs, and investigate
the relationships between them and their limitations. We investigate those graphs
which may be domination graphs of tournaments using excluded minors. Such
graphs have a finite set of obstructions under a modification of the minor partial
order. |
en |
dc.format |
Scanned from print thesis |
en |
dc.language.iso |
en |
en |
dc.publisher |
ResearchSpace@Auckland |
en |
dc.relation.ispartof |
PhD Thesis - University of Auckland |
en |
dc.relation.isreferencedby |
UoA1207305 |
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 |
Minors and planar embeddings of digraphs |
en |
dc.type |
Thesis |
en |
thesis.degree.discipline |
Mathematics |
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 |
pubs.local.anzsrc |
01 - Mathematical Sciences |
en |
pubs.org-id |
Faculty of Science |
en |
dc.identifier.wikidata |
Q111964008 |
|