Note
FAU Electronic Theses and Dissertations Collection
Member of
Contributors
Publisher
Florida Atlantic University
Date Issued
1999
Description
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.
Language
Type
Form
Extent
39 p.
Subject (Topical)
Identifier
9780599299689
ISBN
9780599299689
Additional Information
FAU Electronic Theses and Dissertations Collection
Thesis (M.S.)--Florida Atlantic University, 1999.
Charles E. Schmidt College of Science
Date Backup
1999
Date Text
1999
Date Issued (EDTF)
1999
Extension
FAU
FAU
admin_unit="FAU01", ingest_id="ing1508", creator="staff:fcllz", creation_date="2007-07-19 04:46:30", modified_by="staff:fcllz", modification_date="2011-01-06 13:09:24"
IID
FADT15666
Issuance
monographic
Organizations
Attributed name: Florida Atlantic University
Person Preferred Name
Teng, Cong.
Graduate College
Physical Description
39 p.
application/pdf
Title Plain
Odd sums of long cycles in 2-connected graphs
Use and Reproduction
Copyright © is held by the author with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
http://rightsstatements.org/vocab/InC/1.0/
Origin Information
1999
monographic
Boca Raton, Fla.
Florida Atlantic University
Physical Location
Florida Atlantic University Libraries
Place
Boca Raton, Fla.
Sub Location
Digital Library
Title
Odd sums of long cycles in 2-connected graphs
Other Title Info
Odd sums of long cycles in 2-connected graphs