More Progress on Tough Graphs - The Y2K Report

Doug Bauer, Hajo Broersma, Edward Schmeichel

Research output: Contribution to journalConference articleAcademicpeer-review

108 Downloads (Pure)


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.
Original languageEnglish
Pages (from-to)63-80
JournalElectronic notes in discrete mathematics
Publication statusPublished - Jul 2002
EventNinth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications - Kalamazoo , United States
Duration: 4 Jun 20009 Jun 2000
Conference number: 9


Dive into the research topics of 'More Progress on Tough Graphs - The Y2K Report'. Together they form a unique fingerprint.

Cite this