2 citations · 5 across the 6 of their papers we have counts for
1 paper · 1 filter
Eduard Eiben, Michal Kotrbcik
A graph is equimatchable if each of its matchings is a subset of a maximum matching. It is known that any 2-connected equimatchable graph is either bipartite, or factor-critical, a…