Hamiltonian Decompositions of Complete Multipartite Graphs with Specified Leaves
Metadata Field | Value | Language |
---|---|---|
dc.contributor.advisor | Rodger, Chris | |
dc.contributor.author | McCauley, Laura | |
dc.date.accessioned | 2011-05-05T17:58:30Z | |
dc.date.available | 2011-05-05T17:58:30Z | |
dc.date.issued | 2011-05-05 | |
dc.identifier.uri | http://hdl.handle.net/10415/2600 | |
dc.description.abstract | For any 2-regular spanning subgraph G and H of the complete multipartite graph K with p parts each of size m, conditions are found which guarantee the existence of a 2-factorization of K or of K - I (for some 1-factor I) in which 1. the first and second 2-factors are isomorphic to G and H respectively, and 2.each other 2-factor is a hamilton cycle These conditions are necessary and sufficient when m is odd, and solve the problem when m is even providing that m and p are each at least 6. | en_US |
dc.rights | EMBARGO_NOT_AUBURN | en_US |
dc.subject | Mathematics and Statistics | en_US |
dc.title | Hamiltonian Decompositions of Complete Multipartite Graphs with Specified Leaves | en_US |
dc.type | dissertation | en_US |
dc.embargo.length | NO_RESTRICTION | en_US |
dc.embargo.status | NOT_EMBARGOED | en_US |