Forbidden induced subgraphs for toughness

Katsuhiro Ota, Gabriel Sueiro

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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
Volume73
Issue number2
DOIs
Publication statusPublished - 2013 Jun

Fingerprint

Forbidden Induced Subgraph
Toughness
Graph in graph theory
Connected graph
Forbidden Subgraph
Family

Keywords

  • forbidden subgraph
  • toughness

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Forbidden induced subgraphs for toughness. / Ota, Katsuhiro; Sueiro, Gabriel.

In: Journal of Graph Theory, Vol. 73, No. 2, 06.2013, p. 191-202.

Research output: Contribution to journalArticle

Ota, Katsuhiro ; Sueiro, Gabriel. / Forbidden induced subgraphs for toughness. In: Journal of Graph Theory. 2013 ; Vol. 73, No. 2. pp. 191-202.
@article{420205813fd2447ba5ec2bf1e1a2658d,
title = "Forbidden induced subgraphs for toughness",
abstract = "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.",
keywords = "forbidden subgraph, toughness",
author = "Katsuhiro Ota and Gabriel Sueiro",
year = "2013",
month = "6",
doi = "10.1002/jgt.21667",
language = "English",
volume = "73",
pages = "191--202",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "2",

}

TY - JOUR

T1 - Forbidden induced subgraphs for toughness

AU - Ota, Katsuhiro

AU - Sueiro, Gabriel

PY - 2013/6

Y1 - 2013/6

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

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

KW - forbidden subgraph

KW - toughness

UR - http://www.scopus.com/inward/record.url?scp=84875836932&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875836932&partnerID=8YFLogxK

U2 - 10.1002/jgt.21667

DO - 10.1002/jgt.21667

M3 - Article

AN - SCOPUS:84875836932

VL - 73

SP - 191

EP - 202

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 2

ER -