Skip to main content
Article
Chvátal-Erdös Type Theorems
Discussiones Mathematicae Graph Theory (2010)
• , University of Memphis
• , University of Alaska at Fairbanks
• , Emory University
• , University of Colorado Denver
• , Georgia Southern University
Abstract
The Chvátal-Erdös theorems imply that if G is a graph of order n ≥ 3 with κ(G) ≥ α(G), then G is hamiltonian, and if κ(G) > α(G), then G is hamiltonian-connected. We generalize these results by replacing the connectivity and independence number conditions with a weaker minimum degree and independence number condition in the presence of sufficient connectivity. More specifically, it is noted that if G is a graph of order n and k ≥ 2 is a positive integer such that κ(G) ≥ k, δ(G) > (n+k2-k)/(k+1), and δ(G) ≥ α(G)+k-2, then G is hamiltonian. It is shown that if G is a graph of order n and k ≥ 3 is a positive integer such that κ(G) ≥ 4k2+1, δ(G) > (n+k2-2k)/k, and δ(G) ≥ α(G)+k-2, then G is hamiltonian-connected. This result supports the conjecture that if G is a graph of order n and k ≥ 3 is a positive integer such that κ(G) ≥ k, δ(G) > (n+k2-2k)/k, and δ(G) ≥ α(G)+k-2, then G is hamiltonian-connected, and the conjecture is verified for k = 3 and 4.
Keywords
• Hamiltonian,
• Hamiltonian-connected,
• Chvátal-Erdös condition,
• Independence number
Disciplines
Publication Date
2010
DOI
10.7151/dmgt.1490
Publisher Statement
Citation Information
Ralph J. Faudree, Jill R. Faudree, Ronald J. Gould, Michael S. Jacobson, et al.. "Chvátal-Erdös Type Theorems" Discussiones Mathematicae Graph Theory Vol. 30 Iss. 2 (2010) p. 245 - 256 ISSN: 2083-5892
Available at: http://works.bepress.com/colton_magnant/6/