Title of article :
Not every 2-tough graph is Hamiltonian Original Research Article
Author/Authors :
D. Bauer، نويسنده , , H.J. Broersma، نويسنده , , H.J. Veldman، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2000
Abstract :
We present (94−ε)-tough graphs without a Hamilton path for arbitrary ε>0, thereby refuting a well-known conjecture due to Chvátal. We also present (74−ε)-tough chordal graphs without a Hamilton path for any ε>0.
Keywords :
Traceable graph , 2-tough graph , Toughness , Chordal graph , Hamiltonian graph
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
