1 paper · 1 filter
Zakir Deniz, Tınaz Ekim
A graph G is \emph{equimatchable} if every maximal matching of G has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the…