Maximal Sets of Hamilton Cycles in Complete Multipartite Graphs
Metadata Field | Value | Language |
---|---|---|
dc.contributor.advisor | Rodger, Chris | |
dc.contributor.author | Noble, Abigail | |
dc.date.accessioned | 2012-08-02T15:28:33Z | |
dc.date.available | 2012-08-02T15:28:33Z | |
dc.date.issued | 2012-08-02 | |
dc.identifier.uri | http://hdl.handle.net/10415/3310 | |
dc.description.abstract | A set of S edge-disjoint hamilton cycles in a graph G is said to be maximal if the hamilton cycles in S form a subgraph of G such that G-E(S) has no hamilton cycle. The set of integers m for which a graph G contains a maximal set of m edge-disjoint hamilton cycles has previously been determined whenever G is a complete graph, a complete bipartite graph, and in many cases when G is a complete multipartite graph. In this dissertation, some of the remaining open cases regarding complete multipartite graphs will be resolved. | en_US |
dc.rights | EMBARGO_NOT_AUBURN | en_US |
dc.subject | Mathematics and Statistics | en_US |
dc.title | Maximal Sets of Hamilton Cycles in Complete Multipartite Graphs | en_US |
dc.type | dissertation | en_US |
dc.embargo.length | NO_RESTRICTION | en_US |
dc.embargo.status | NOT_EMBARGOED | en_US |