On two equimatchable graph classes (Q1810651)

In this paper, equimatchability in several well-known families of graphs in studied. In particular, equimatchable cubic graphs and the equimatchable 3-connected planar (3-polytopal) graphs are determined. The authors have used extensively the Gallai-Edmonds decomposition theory for graphs in terms of their maximum matchings to obtain these results. It is shown that there are precisely 23 3-connected planar graphs which are equimatchable and that there are only 2 cubic equimatchable graphs.