On two equimatchable graph classes
type: Item
instance of: scholarly article
title: On two equimatchable graph classes
zbMATH Open document ID: 1022.05065
DOI: 10.1016/S0012-365X(02)00813-0
author: Ken-ichi Kawarabayashi
author: Michael D. Plummer
author: Akira Saito
published in: Discrete Mathematics
publication date: 2003-06-09T00:00:00Z
review text: 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.
reviewed by: Bai Kishan Dass
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1924771
zbMATH Keywords: connected planar graphs
MaRDI profile type: Publication
cites work: Equimatchable factor‐critical graphs
cites work: Q3340896
cites work: Matching-perfect and cover-perfect graphs
cites work: Matching theory
cites work: Q5591378
cites work: Q4732491
cites work: Randomly matchable graphs
Recommended article: On two extensions of equimatchable graphs
Recommended article: Q4514612
Recommended article: Q3565868
Recommended article: Q3615976
Recommended article: A class of `matching-equivalent' bipartite graphs
Recommended article: Equivalence classes in matching covered graphs
Recommended article: Q3340896
Recommended article: On 2-equitable graphs
Recommended article: Q4669906
Recommended article: Totally equimatchable graphs
description: scientific article; zbMATH DE number 1924771