This Is AuburnElectronic Theses and Dissertations

Show simple item record

Maximal Sets of Hamilton Cycles in Complete Multipartite Graphs


Metadata FieldValueLanguage
dc.contributor.advisorRodger, Chris
dc.contributor.authorNoble, Abigail
dc.date.accessioned2012-08-02T15:28:33Z
dc.date.available2012-08-02T15:28:33Z
dc.date.issued2012-08-02
dc.identifier.urihttp://hdl.handle.net/10415/3310
dc.description.abstractA 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.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titleMaximal Sets of Hamilton Cycles in Complete Multipartite Graphsen_US
dc.typedissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record