More Progress on Tough Graphs - The Y2K Report


Bauer, Doug and Broersma, Hajo and Schmeichel, Edward (2002) More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics, 11 . pp. 63-80. ISSN 1571-0653

[img] PDF
Restricted to UT campus only
: Request a copy
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.
Item Type:Article
Additional information:The Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications, Kalamazoo, Michigan, USA, 04-09 June 2000
Copyright:© 2002 Elsevier
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 208788