This Is AuburnElectronic Theses and Dissertations

Show simple item record

Almost Resolvable Maximum Packings of Complete Bipartite Graphs with 4-Cycles


Metadata FieldValueLanguage
dc.contributor.advisorHoffman, Dean
dc.contributor.authorOhlson, Vicky
dc.date.accessioned2012-07-17T18:33:24Z
dc.date.available2012-07-17T18:33:24Z
dc.date.issued2012-07-17
dc.identifier.urihttp://hdl.handle.net/10415/3213
dc.description.abstractA packing of a complete bipartite graph K(m,n) with 4-cycles is a decomposition of K(m,n) into a collection C of edge-disjoint 4-cycles and a set of unused edges L referred to as the leave. If C is as large as possible (and L is as small as possible), then the packing is a maximum packing. An almost parallel class of a maximum packing is a largest possible set of vertex disjoint 4-cycles. In this paper we establish values of m and n for which a maximum packing of K(m,n) with 4-cycles may be resolved into almost parallel classes with the remaining cycles vertex disjoint.en_US
dc.rightsEMBARGO_NOT_AUBURNen_US
dc.subjectMathematics and Statisticsen_US
dc.titleAlmost Resolvable Maximum Packings of Complete Bipartite Graphs with 4-Cyclesen_US
dc.typedissertationen_US
dc.embargo.lengthNO_RESTRICTIONen_US
dc.embargo.statusNOT_EMBARGOEDen_US

Files in this item

Show simple item record