Forbidden subgraphs generating a finite set

Jun Fujisawa, Michael D. Plummer, Akira Saito

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


For a set F of connected graphs, a graph G is said to be F -free if G does not contain any member of F as an induced subgraph. The members of F are referred to as forbidden subgraphs. When we study the relationship between forbidden subgraphs and a certain graph property, we often allow the possibility of the existence of exceptional graphs as long as their number is finite. However, in this type of research, if the set of k-connected F -free graphs itself, denoted by Gk(F ), is finite, then every graph in Gk(F ) logically satisfies all the graph properties, except for possibly a finite number of exceptions. If this occurs, F does not give any information about a particular property. We think that such sets F obscure the view in the study of forbidden subgraphs, and we want to remove them. With this motivation, we study the sets F with finite Gk(F ). We prove that if |F | ≤ 2 and Gk(F ) is finite, then either K1,2 F or F consists of a complete graph and a star. For each of the values of k, 1 ≤ k ≤ 6, we then characterize all the pairs {Kl, K1,m} such that Gk({Kl, K1,m}) is finite. We also give a complete characterization of F with |F | ≤ 3 and finite G2(F ).

Original languageEnglish
Pages (from-to)1835-1842
Number of pages8
JournalDiscrete Mathematics
Issue number19
Publication statusPublished - 2013


  • Forbidden subgraphs
  • Hamiltonian cycles
  • K-connected graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Forbidden subgraphs generating a finite set'. Together they form a unique fingerprint.

Cite this