Forbidden triples for perfect matchings
Katsuhiro Ota, Michael D. Plummer, Akira Saito · Journal of Graph Theory · 2011
Let ℋ︁ be a set of connected graphs. A graph is said to be ℋ︁-free if it does not contain any member of ℋ︁ 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 ℋ︁ with |ℋ︁|⩽2 such that every connected ℋ︁-free graph of sufficiently large even order has a perfect matching. Extending this line of research, we give the characterization in the case of |ℋ︁|⩽3. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 250–259, 2011