## Abstract

In 2004, Biedl et al proved that if (Formula presented.) is a connected cubic graph of order (Formula presented.), then (Formula presented.), where (Formula presented.) is the matching number of (Formula presented.). The graphs achieving equality in this bound were characterized in 2010 by O and West. In 2017, Haxell and Scott proved that if (Formula presented.) is a connected subcubic graph, then (Formula presented.), where (Formula presented.) denotes the number of vertices of degree (Formula presented.) in (Formula presented.). In this paper, we characterize the graphs achieving equality in the lower bound on the matching number given by Haxell and Scott.

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

Pages (from-to) | 455-471 |

Number of pages | 17 |

Journal | Journal of Graph Theory |

Volume | 96 |

Issue number | 4 |

DOIs | |

Publication status | Published - Mar 2021 |

## Keywords

- matching number
- subcubic graphs

## ASJC Scopus subject areas

- Geometry and Topology