Date of Award
1999
Document Type
Thesis
Publication Status
Version of Record
Submission Date
October 2026
Thesis/Dissertation Advisor [Chair]
Locke, Stephen C.
Abstract
Let G be a 2-connected graph with minimum degree d and with at least d + 2 vertices. Suppose that G is not a cycle. Then there is an odd set of cycles, each with length at least d + 1, such that they sum to zero. If G is also non-hamiltonian or bipartite, cycles of length at least 2d can be used.
Extent
39 p.
Recommended Citation
Teng, Cong., "Odd sums of long cycles in 2-connected graphs" (1999). Electronic Theses and Dissertations 1990 - 1999. 1500.
https://digitalcommons.fau.edu/etd_general_4/1500
Identifier
FADT15666
Format
COinS
Comments
FAU Electronic Theses and Dissertations Collection|Thesis (M.S.)--Florida Atlantic University, 1999.|Charles E. Schmidt College of Science|FAU Electronic Theses and Dissertations Collection