More Progress on Tough Graphs - The Y2K Report

Doug Bauer, Hajo Broersma, Edward Schmeichel

Research output: Contribution to journalConference articleAcademicpeer-review

32 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)63-80
JournalElectronic notes in discrete mathematics
Volume11
DOIs
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

Fingerprint

Hamiltonians
Toughness
Graph in graph theory
Continue
Cycle

Cite this

Bauer, Doug ; Broersma, Hajo ; Schmeichel, Edward. / More Progress on Tough Graphs - The Y2K Report. In: Electronic notes in discrete mathematics. 2002 ; Vol. 11. pp. 63-80.
@article{e2bb2e3e0f134ec88ba0e84fe4abb50e,
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 ϵ > 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.",
author = "Doug Bauer and Hajo Broersma and Edward Schmeichel",
year = "2002",
month = "7",
doi = "10.1016/S1571-0653(04)00055-1",
language = "English",
volume = "11",
pages = "63--80",
journal = "Electronic notes in discrete mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

More Progress on Tough Graphs - The Y2K Report. / Bauer, Doug; Broersma, Hajo; Schmeichel, Edward.

In: Electronic notes in discrete mathematics, Vol. 11, 07.2002, p. 63-80.

Research output: Contribution to journalConference articleAcademicpeer-review

TY - JOUR

T1 - More Progress on Tough Graphs - The Y2K Report

AU - Bauer, Doug

AU - Broersma, Hajo

AU - Schmeichel, Edward

PY - 2002/7

Y1 - 2002/7

N2 - 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.

AB - 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.

U2 - 10.1016/S1571-0653(04)00055-1

DO - 10.1016/S1571-0653(04)00055-1

M3 - Conference article

VL - 11

SP - 63

EP - 80

JO - Electronic notes in discrete mathematics

JF - Electronic notes in discrete mathematics

SN - 1571-0653

ER -