This Is AuburnElectronic Theses and Dissertations

Show simple item record

Hamiltonian Decompositions of Complete Multipartite Graphs with Specified Leaves


Metadata FieldValueLanguage
dc.contributor.advisorRodger, Chris
dc.contributor.authorMcCauley, Laura
dc.date.accessioned2011-05-05T17:58:30Z
dc.date.available2011-05-05T17:58:30Z
dc.date.issued2011-05-05
dc.identifier.urihttp://hdl.handle.net/10415/2600
dc.description.abstractFor 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.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titleHamiltonian Decompositions of Complete Multipartite Graphs with Specified Leavesen_US
dc.typedissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record