Forbidden triples for perfect matchings

Katsuhiro Ota, Michael D. Plummer, Akira Saito

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. Plummer and Saito [J Graph Theory 50 (2005), 1-12] and Fujita et al. [J Combin Theory Ser B 96 (2006), 315-324] characterized all H with |H|≤2 such that every connected H-free graph of sufficiently large even order has a perfect matching. Extending this line of research, we give the characterization in the case of |H|≤3.

Original languageEnglish
Pages (from-to)250-259
Number of pages10
JournalJournal of Graph Theory
Issue number3
Publication statusPublished - 2011 Jul


  • forbidden subgraph
  • perfect matching

ASJC Scopus subject areas

  • Geometry and Topology


Dive into the research topics of 'Forbidden triples for perfect matchings'. Together they form a unique fingerprint.

Cite this