| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8902878 | Discrete Mathematics | 2018 | 13 Pages |
Abstract
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Saieed Akbari, Hadi Alizadeh, Tınaz Ekim, Didem Gözüpek, Mordechai Shalom,