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.
ASJC Scopus subject areas
- Geometry and Topology