Not every 2-tough graph is Hamiltonian

Not every 2-tough graph is Hamiltonian

0.00 Avg rating0 Votes
Article ID: iaor20012910
Country: Netherlands
Volume: 99
Issue: 1/3
Start Page Number: 317
End Page Number: 321
Publication Date: Feb 2000
Journal: Discrete Applied Mathematics
Authors: , ,
Abstract:

We present (9/4–•)-tough graphs without a Hamilton path for arbitrary •>0, thereby refuting a well-known conjecture due to Chvátal. We also present (7/4–•)-tough chordal graphs without a Hamilton path for any •>0.

Reviews

Required fields are marked *. Your email address will not be published.