More progress on tough graphs - The Y2K report

Share/Save/Bookmark

Bauer, D. and Broersma, H.J. and Schmeichel, E. (2000) More progress on tough graphs - The Y2K report. [Report]

[img]
Preview
PDF
132Kb
Abstract:We now know that not every $2$-tough graph is hamiltonian. In fact for every $\epsilon > 0$, there exists a ($9/4 - \epsilon$) - tough nontraceable graph. We continue our quadrennial survey of results that relate the toughness of a graph to its cycle structure.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65723
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 141201