dc.contributor.author |
Brand, Neal |
en |
dc.contributor.author |
Morton, Margaret |
en |
dc.date.accessioned |
2009-08-28T03:21:22Z |
en |
dc.date.available |
2009-08-28T03:21:22Z |
en |
dc.date.issued |
1998 |
en |
dc.identifier.citation |
Department of Mathematics - Research Reports-403 (1998) |
en |
dc.identifier.issn |
1173-0889 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/5028 |
en |
dc.description.abstract |
A graph is g-universal if it satisfies two conditions. First it must contain a subdivision of every proper planar graph of degree at most three as a subgraph. Second, the function g puts a restriction on the subdivision. In particular, for a planar graph H of degree at most three, a fixed vertex $w_0$ of H, and an arbitrary vertex w of H, the images of the vertices $w_0$ and w in the universal graph are no more than $g(d(w_0, w))$ apart. We show that a large class of planar graphs are $O(n^3)4-universal. |
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=403 |
en |
dc.title |
Planar Universal Graphs |
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 |