A characterization of graphs with given maximum degree and smallest possible matching number. - Michael A. Henning; Zekhaya B. Shozi (Discret. Math., 2021)

A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number. - Michael A. Henning; Zekhaya B. Shozi (J. Graph Theory, 2021)

A characterization of graphs with given maximum degree and smallest possible matching number: II. - Michael A. Henning; Zekhaya B. Shozi (Discret. Math., 2022)

A generalization of Petersen's matching theorem. - Michael A. Henning; Zekhaya B. Shozi (Discret. Math., 2023)