2-connected equimatchable graphs on surfaces

Eduard Eiben, Michal Kotrbčík

A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-cri…