Decomposition of Cubic Graphs on the Torus and Klein Bottle

dc.contributor.advisor Ye, Dong Bachstein, Anna Caroline
dc.contributor.committeemember Zha, Xiaoya
dc.contributor.committeemember Stephens, David
dc.contributor.department Basic & Applied Sciences en_US 2015-12-18T19:10:32Z 2015-12-18T19:10:32Z 2015-10-30
dc.description.abstract It was conjectured by Hoffman-Ostenhof that the edge set of every cubic graph can be decomposed into a spanning tree, a matching, and a family of cycles. This conjecture was verified for many graphs such as the Peterson graph, prisms over cycles, and Hamiltonian graphs. Later the conjecture was also verified for 3-connected cubic graphs on the plane and protective plane by Kenta Ozeki and Dong Ye. In this paper we will verify the conjecture for 3-connected cubic graph on the torus and Klein bottle. M.S.
dc.publisher Middle Tennessee State University
dc.subject Graphs
dc.subject.umi Mathematics
dc.thesis.degreegrantor Middle Tennessee State University
dc.thesis.degreelevel Masters
dc.title Decomposition of Cubic Graphs on the Torus and Klein Bottle
dc.type Thesis
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
1.21 MB
Adobe Portable Document Format