This Is AuburnElectronic Theses and Dissertations

Show simple item record

Hamilton Cycles In Multipartite Graphs With Two Associative Classes


Metadata FieldValueLanguage
dc.contributor.advisorRodger, Chris
dc.contributor.authorDemir , Mustafa
dc.date.accessioned2019-04-17T19:06:31Z
dc.date.available2019-04-17T19:06:31Z
dc.date.issued2019-04-17
dc.identifier.urihttp://hdl.handle.net/10415/6626
dc.description.abstractIn this dissertation, the following two problems are considered: the embedding problem of when a k-edge-coloring of a multipartite graph G can be embedded into a Hamilton decomposition of multipartite graph H containing G; and the existence problem of when there exists a maximal set of t edge-disjoint Hamilton cycles in multipartite graph G. Both results proved make use of the method of amalgamations.en_US
dc.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titleHamilton Cycles In Multipartite Graphs With Two Associative Classesen_US
dc.typePhD Dissertationen_US
dc.embargo.lengthMONTHS_WITHHELD:24en_US
dc.embargo.statusEMBARGOEDen_US
dc.embargo.enddate2021-04-01en_US

Files in this item

Show simple item record