Pairs and triples of forbidden subgraphs and the existence of a 2-factor

R. E.L. Aldred, Jun Fujisawa, Akira Saito

Research output: Contribution to journalArticle

Abstract

Let H be a set of connected graphs, each of which has order at least three, and suppose that there exist infinitely many connected H-free graphs of minimum degree at least two and all except for finitely many of them have a 2-factor. In [J. Graph Theory, 64 (2010), 250–266], we proved that if |H| ≤ 3, then one of the members in H is a star. In this article, we determine the remaining members of H and hence give a complete characterization of the pairs and triples of forbidden subgraphs.

LanguageEnglish
Pages61-82
Number of pages22
JournalJournal of Graph Theory
Volume90
Issue number1
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Forbidden Subgraph
Minimum Degree
Graph theory
Connected graph
Star
Graph in graph theory

Keywords

  • 2-factor
  • forbidden subgraph

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Pairs and triples of forbidden subgraphs and the existence of a 2-factor. / Aldred, R. E.L.; Fujisawa, Jun; Saito, Akira.

In: Journal of Graph Theory, Vol. 90, No. 1, 01.01.2019, p. 61-82.

Research output: Contribution to journalArticle

Aldred, R. E.L. ; Fujisawa, Jun ; Saito, Akira. / Pairs and triples of forbidden subgraphs and the existence of a 2-factor. In: Journal of Graph Theory. 2019 ; Vol. 90, No. 1. pp. 61-82.
@article{8a2a758d93f945e7906d0a209c09b43e,
title = "Pairs and triples of forbidden subgraphs and the existence of a 2-factor",
abstract = "Let H be a set of connected graphs, each of which has order at least three, and suppose that there exist infinitely many connected H-free graphs of minimum degree at least two and all except for finitely many of them have a 2-factor. In [J. Graph Theory, 64 (2010), 250–266], we proved that if |H| ≤ 3, then one of the members in H is a star. In this article, we determine the remaining members of H and hence give a complete characterization of the pairs and triples of forbidden subgraphs.",
keywords = "2-factor, forbidden subgraph",
author = "Aldred, {R. E.L.} and Jun Fujisawa and Akira Saito",
year = "2019",
month = "1",
day = "1",
doi = "10.1002/jgt.22368",
language = "English",
volume = "90",
pages = "61--82",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Pairs and triples of forbidden subgraphs and the existence of a 2-factor

AU - Aldred, R. E.L.

AU - Fujisawa, Jun

AU - Saito, Akira

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Let H be a set of connected graphs, each of which has order at least three, and suppose that there exist infinitely many connected H-free graphs of minimum degree at least two and all except for finitely many of them have a 2-factor. In [J. Graph Theory, 64 (2010), 250–266], we proved that if |H| ≤ 3, then one of the members in H is a star. In this article, we determine the remaining members of H and hence give a complete characterization of the pairs and triples of forbidden subgraphs.

AB - Let H be a set of connected graphs, each of which has order at least three, and suppose that there exist infinitely many connected H-free graphs of minimum degree at least two and all except for finitely many of them have a 2-factor. In [J. Graph Theory, 64 (2010), 250–266], we proved that if |H| ≤ 3, then one of the members in H is a star. In this article, we determine the remaining members of H and hence give a complete characterization of the pairs and triples of forbidden subgraphs.

KW - 2-factor

KW - forbidden subgraph

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

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

U2 - 10.1002/jgt.22368

DO - 10.1002/jgt.22368

M3 - Article

VL - 90

SP - 61

EP - 82

JO - Journal of Graph Theory

T2 - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 1

ER -