@book{f1c8e81ad91a44b397ba14dea9f05955,
title = "More progress on tough graphs -- The Y2K report",
abstract = "We now know that not every \$2\$-tough graph is hamiltonian. In fact for every \$\textbackslash{}epsilon > 0\$, there exists a (\$9/4 - \textbackslash{}epsilon\$) - tough nontraceable graph. We continue our quadrennial survey of results that relate the toughness of a graph to its cycle structure.",
keywords = "MSC-05C35, MSC-05C38, EWI-3356, METIS-141201, IR-65723, MSC-05C45",
author = "D. Bauer and Broersma, \{Haitze J.\} and E. Schmeichel",
note = "Imported from MEMORANDA",
year = "2000",
language = "Undefined",
isbn = "0169-2690",
series = "Memorandum / Faculty of Mathematical Sciences",
publisher = "University of Twente",
number = "1536",
address = "Netherlands",
}