Forbidden induced subgraphs for toughness

Katsuhiro Ota, Gabriel Sueiro

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Let F be a family of connected graphs. A graph G is said to be F-free if G is H-free for every graph H in F. We study the relation between forbidden subgraphs in a connected graph G and the resulting toughness of G. In particular, we consider the problem of characterizing the graph families F such that every large enough connected F-free graph is t-tough. In this article, we solve this problem for every real positive number t.

Original languageEnglish
Pages (from-to)191-202
Number of pages12
JournalJournal of Graph Theory
Issue number2
Publication statusPublished - 2013 Jun


  • forbidden subgraph
  • toughness

ASJC Scopus subject areas

  • Geometry and Topology


Dive into the research topics of 'Forbidden induced subgraphs for toughness'. Together they form a unique fingerprint.

Cite this