The following publications are possibly variants of this publication:
- A characterization of graphs with given maximum degree and smallest possible matching numberMichael A. Henning, Zekhaya B. Shozi. DM, 344(7):112426, 2021. [doi]
- Tight lower bounds on the matching number in a graph with given maximum degreeMichael A. Henning, Anders Yeo. jgt, 89(2):115-149, 2018. [doi]
- Matching and edge-connectivity in graphs with given maximum degreeMichael A. Henning, Anders Yeo. DM, 344(8):112438, 2021. [doi]
- Smallest domination number and largest independence number of graphs and forests with given degree sequenceMichael Gentner, Michael A. Henning, Dieter Rautenbach. jgt, 88(1):131-145, 2018. [doi]
- Largest domination number and smallest independence number of forests with given degree sequenceMichael Gentner, Michael A. Henning, Dieter Rautenbach. DAM, 206:181-187, 2016. [doi]