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.
|Journal||Electronic notes in discrete mathematics|
|Publication status||Published - Jul 2002|
|Event||Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications - Kalamazoo , United States|
Duration: 4 Jun 2000 → 9 Jun 2000
Conference number: 9