Date of Graduation
1998
Document Type
Dissertation/Thesis
Abstract
A 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.
Recommended Citation
Buchanan, Hollie Lee, "Graph factors and Hamiltonian decompositions." (1998). Graduate Theses, Dissertations, and Problem Reports. 8544.
https://researchrepository.wvu.edu/etd/8544