Title of article :
More Progress on Tough Graphs - The Y2K Report
Author/Authors :
Bauer، نويسنده , , Doug and Broersma، نويسنده , , Hajo and Schmeichel، نويسنده , , Edward، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2002
Abstract :
We now know that not every 2-tough graph is hamiltonian. In fact for every ϵ > 0, there exists a (9/4−ϵ)-tough nontraceable graph. We continue our quadrennial survey of results that relate the toughness of a graph to its cycle structure.
Keywords :
Toughness , t-tough graph , hamiltonian graph , traceable graph , Factor , Complexity , chordal graph , Hamilton cycle , circumference
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
