Forbidden triples generating a finite set of 3-connected graphs

Yoshimi Egawa, Michitaka Furuya, Jun Fujisawa, Michael D. Plummer, Akira Saito

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. We let G3 (F) denote the set of all 3-connected F-free graphs. This paper is concerned with sets F of connected graphs such that |F| = 3 and G3(F) is finite. Among other results, we show that for an integer m ≥ 3 and a connected graph T of order greater than or equal to 4, G3({K4,K2,m, T}) is finite if and only if T is a path of order 4 or 5.

Original languageEnglish
Article number013
JournalElectronic Journal of Combinatorics
Issue number3
Publication statusPublished - 2015 Jul 17


  • 3-connected graph
  • Forbidden subgraph
  • Forbidden triple

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Forbidden triples generating a finite set of 3-connected graphs'. Together they form a unique fingerprint.

Cite this