Show simple item record

dc.contributor.advisor Dean, Nathaniel
dc.creatorHusband, Summer Michele
dc.date.accessioned 2009-06-04T08:28:48Z
dc.date.available 2009-06-04T08:28:48Z
dc.date.issued 2000
dc.identifier.urihttps://hdl.handle.net/1911/17432
dc.description.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.
dc.format.extent 30 p.
dc.format.mimetype application/pdf
dc.language.iso eng
dc.subjectMathematics
Operations research
dc.title Restricted 2-factors in bipartite graphs
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Operations Research
thesis.degree.discipline Natural Sciences
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Arts
dc.identifier.citation Husband, Summer Michele. "Restricted 2-factors in bipartite graphs." (2000) Master’s Thesis, Rice University. https://hdl.handle.net/1911/17432.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record