id: 01924771
dt: j
an: 01924771
au: Kawarabayashi, Ken-ichi; Plummer, Michael D.; Saito, Akira
ti: On two equimatchable graph classes.
so: Discrete Math. 266, No.1-3, 263-274 (2003).
py: 2003
pu: Elsevier Science B.V. (North-Holland), Amsterdam
la: EN
cc: 
ut: connected planar graphs
ci: 
li: doi:10.1016/S0012-365X(02)00813-0
ab: 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.
rv: Bal Kishan Dass (Delhi)