Restricted 2-factors in bipartite graphs

Simple item page
dc.contributor.advisorDean, Nathaniel
dc.creatorHusband, Summer Michele
dc.date.accessioned2009-06-04T08:28:48Z
dc.date.available2009-06-04T08:28:48Z
dc.date.issued2000
dc.description.abstractThe k-restricted 2-factor problem is that of finding a spanning subgraph consisting of disjoint cycles with no cycle of length less than or equal to k. It is a generalization of the well known Hamilton cycle problem and is equivalent to this problem when n2≤k≤n-1 . This paper considers necessary and sufficient conditions, algorithms, and polyhedral conditions for 2-factors in bipartite graphs and restricted 2-factors in bipartite graphs. We introduce a generalization of the necessary and sufficient condition for 4-restricted 2-factors in bipartite graphs to 2k-restricted 2-factors in bipartite graphs of a particular form.
dc.format.extent30 p.en_US
dc.format.mimetypeapplication/pdf
dc.identifier.callnoTHESIS MATH.SCI. 2001 HUSBAND
dc.identifier.citationHusband, Summer Michele. "Restricted 2-factors in bipartite graphs." (2000) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/17432">https://hdl.handle.net/1911/17432</a>.
dc.identifier.urihttps://hdl.handle.net/1911/17432
dc.language.isoeng
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
dc.subjectMathematics
dc.subjectOperations research
dc.titleRestricted 2-factors in bipartite graphs
dc.typeThesis
dc.type.materialText
thesis.degree.departmentMathematical Sciences
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.nameMaster of Arts
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1405675.PDF
Size:
919.39 KB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Electronic Theses and Dissertations