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

PDF
Restricted to UT campus only: Request a copy
744Kb

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
Copyright:	© 2002 Elsevier
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/74855
Official URL:	http://dx.doi.org/10.1016/S1571-0653(04)00055-1
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 208788