### Abstract

Let F be a family of connected graphs. A graph G is said to be F-free if G is H-free for every graph H in F. Fujita et al. (2006) [2] studied the problem of characterizing the families of graphs F such that every large enough connected F-free graph of odd order has a near perfect matching. In the same work, the authors characterized such families F, but in the case where every graph in F is triangle-free. In this paper, we complete the characterization of all such families, removing the triangle-free condition.

Original language | English |
---|---|

Pages (from-to) | 1267-1280 |

Number of pages | 14 |

Journal | Discrete Mathematics |

Volume | 313 |

Issue number | 11 |

DOIs | |

Publication status | Published - 2013 Feb 14 |

### Keywords

- Forbidden subgraph
- Near perfect matching
- Perfect matching

### ASJC Scopus subject areas

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint Dive into the research topics of 'Forbidden induced subgraphs for near perfect matchings'. Together they form a unique fingerprint.

## Cite this

Ota, K., Ozeki, K., & Sueiro, G. (2013). Forbidden induced subgraphs for near perfect matchings.

*Discrete Mathematics*,*313*(11), 1267-1280. https://doi.org/10.1016/j.disc.2013.01.020