On Three Extensions of Equimatchable Graphs

A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce three extensions of the property of equimatchability and present some initial structural and algorithmic insights about them.