Abstract

We survey results and open problems related to the toughness of graphs.
Original languageUndefined
Pages (from-to)28-52
Number of pages25
JournalBulletin of the European Association for Theoretical Computer Science
Volume117
StatePublished - Oct 2015

Fingerprint

Toughness
Open problems
Graph in graph theory

Keywords

  • MSC-05C
  • Toughness
  • EWI-26630
  • IR-98888
  • Tough graph
  • METIS-315124
  • Cycle structure

Cite this

Broersma, Haitze J. / How tough is toughness?

In: Bulletin of the European Association for Theoretical Computer Science, Vol. 117, 10.2015, p. 28-52.

Research output: ScientificArticle

@article{b6e6cf9742264561b374bc8670fc1c0f,
title = "How tough is toughness?",
abstract = "We survey results and open problems related to the toughness of graphs.",
keywords = "MSC-05C, Toughness, EWI-26630, IR-98888, Tough graph, METIS-315124, Cycle structure",
author = "Broersma, {Haitze J.}",
note = "eemcs-eprint-26630",
year = "2015",
month = "10",
volume = "117",
pages = "28--52",
journal = "Bulletin of the European Association for Theoretical Computer Science",
issn = "0252-9742",

}

How tough is toughness? / Broersma, Haitze J.

In: Bulletin of the European Association for Theoretical Computer Science, Vol. 117, 10.2015, p. 28-52.

Research output: ScientificArticle

TY - JOUR

T1 - How tough is toughness?

AU - Broersma,Haitze J.

N1 - eemcs-eprint-26630

PY - 2015/10

Y1 - 2015/10

N2 - We survey results and open problems related to the toughness of graphs.

AB - We survey results and open problems related to the toughness of graphs.

KW - MSC-05C

KW - Toughness

KW - EWI-26630

KW - IR-98888

KW - Tough graph

KW - METIS-315124

KW - Cycle structure

M3 - Article

VL - 117

SP - 28

EP - 52

JO - Bulletin of the European Association for Theoretical Computer Science

T2 - Bulletin of the European Association for Theoretical Computer Science

JF - Bulletin of the European Association for Theoretical Computer Science

SN - 0252-9742

ER -