Restricted 2-factors in bipartite graphs
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The 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.
Description
Advisor
Degree
Type
Keywords
Citation
Husband, Summer Michele. "Restricted 2-factors in bipartite graphs." (2000) Master’s Thesis, Rice University. https://hdl.handle.net/1911/17432.