Premium
Pairs and triples of forbidden subgraphs and the existence of a 2‐factor
Author(s) -
Aldred R. E. L.,
Fujisawa Jun,
Saito Akira
Publication year - 2019
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.22368
Subject(s) - mathematics , combinatorics , graph , degree (music) , order (exchange) , star (game theory) , characterization (materials science) , discrete mathematics , set (abstract data type) , computer science , mathematical analysis , physics , materials science , finance , acoustics , economics , nanotechnology , programming language
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.