Hunting for torus obstructions
| dc.contributor.author | Chambers, John | |
| dc.contributor.supervisor | Myrvold, W. J. | |
| dc.date.accessioned | 2021-06-04T01:49:22Z | |
| dc.date.available | 2021-06-04T01:49:22Z | |
| dc.date.copyright | 2002 | en_US |
| dc.date.issued | 2021-06-03 | |
| dc.degree.department | Department of Computer Science | en_US |
| dc.degree.level | Master of Science M.Sc. | en_US |
| dc.description.abstract | A torus is a sphere with one handle. A graph is toroidal if it embeds in the torus with no crossing edges. A topological obstruction for the torus is a graph G with minimum vertex degree three that is not embeddable in the torus but for all edges e, G - e embeds in the torus. A minor order obstruction has the additional property that for all edges e, G contract e embeds in the torus. Two algorithms to find torus obstructions are presented. Using these algorithms, a new lower bound on the number of torus obstructions is established at 239,451 topological obstructions, 16,682 of which are minor order. Also, an alternate approach to finding the torus obstructions is discussed. Implementation of this approach requires knowing the projective planar minor order torus obstructions. An additional contribution of this thesis is the determination of the complete set of 270 projective planar minor order obstructions for the torus. | en_US |
| dc.description.scholarlevel | Graduate | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/13017 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.title | Hunting for torus obstructions | en_US |
| dc.type | Thesis | en_US |