Abstract
dc:description.abstractA necessary and sufficient condition is obtained for a bipartite graph to have an f-factor which includes a designated set of edges and is disjoint from another designated set of edges. Various other characterizations are obtained for similar subgraph structures, and a characterization is obtained for a bipartite graph to have an f-factor which includes no one of a collection of designated sets. This last characterization is used with several coloring arguments to show that {dollar}K\\sb{lcub}2n+1{rcub}\\\\{dollar}(any 2-factor), or simply, any {dollar}(2n-2){dollar}-regular graph on {dollar}2n+1{dollar} vertices, admits a Hamiltonian decomposition.
Degree
thesis:*- Name thesis:degree_name
- PhD
- Level thesis:degree_level
- Dissertation
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Buchanan, Hollie Lee
- Contributors dc:contributor
-
- Anthony Hilton
- Chris Rodger
- Michael E. Mays
- Henry W. Gould
Identifiers
dc:identifier.*- Identifier
- https://researchrepository.wvu.edu/etd/8544