Dean, Nathaniel2009-06-042009-06-042000Husband, 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>.https://hdl.handle.net/1911/17432The 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&le;k&le;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.30 p.application/pdfengCopyright 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.MathematicsOperations researchThesisTHESIS MATH.SCI. 2001 HUSBAND