More progress on tough graphs -- The Y2K report

D. Bauer, Haitze J. Broersma, E. Schmeichel

Research output: Book/ReportReportProfessional

41 Downloads (Pure)

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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversiteit Twente
Number of pages19
ISBN (Print)0169-2690
Publication statusPublished - 2000

Publication series

NameMemorandum / Faculty of Mathematical Sciences
PublisherDepartment of Applied Mathematics, University of Twente
No.1536
ISSN (Print)0169-2690

Keywords

  • MSC-05C35
  • MSC-05C38
  • EWI-3356
  • METIS-141201
  • IR-65723
  • MSC-05C45

Cite this

Bauer, D., Broersma, H. J., & Schmeichel, E. (2000). More progress on tough graphs -- The Y2K report. (Memorandum / Faculty of Mathematical Sciences; No. 1536). Enschede: Universiteit Twente.
Bauer, D. ; Broersma, Haitze J. ; Schmeichel, E. / More progress on tough graphs -- The Y2K report. Enschede : Universiteit Twente, 2000. 19 p. (Memorandum / Faculty of Mathematical Sciences; 1536).
@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 $\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.",
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 = "Universiteit Twente",
number = "1536",

}

Bauer, D, Broersma, HJ & Schmeichel, E 2000, More progress on tough graphs -- The Y2K report. Memorandum / Faculty of Mathematical Sciences, no. 1536, Universiteit Twente, Enschede.

More progress on tough graphs -- The Y2K report. / Bauer, D.; Broersma, Haitze J.; Schmeichel, E.

Enschede : Universiteit Twente, 2000. 19 p. (Memorandum / Faculty of Mathematical Sciences; No. 1536).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - More progress on tough graphs -- The Y2K report

AU - Bauer, D.

AU - Broersma, Haitze J.

AU - Schmeichel, E.

N1 - Imported from MEMORANDA

PY - 2000

Y1 - 2000

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

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

KW - MSC-05C35

KW - MSC-05C38

KW - EWI-3356

KW - METIS-141201

KW - IR-65723

KW - MSC-05C45

M3 - Report

SN - 0169-2690

T3 - Memorandum / Faculty of Mathematical Sciences

BT - More progress on tough graphs -- The Y2K report

PB - Universiteit Twente

CY - Enschede

ER -

Bauer D, Broersma HJ, Schmeichel E. More progress on tough graphs -- The Y2K report. Enschede: Universiteit Twente, 2000. 19 p. (Memorandum / Faculty of Mathematical Sciences; 1536).