Equimatchable Claw-Free Graphs


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, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable clawfree graph families. This characterization implies an efficient recognition algorithm.

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@article{Akbari2016EquimatchableCG, title={Equimatchable Claw-Free Graphs}, author={Saieed Akbari and Hadi Alizadeh and Tinaz Ekim and Didem G{\"{o}z{\"{u}pek and Mordechai Shalom}, journal={CoRR}, year={2016}, volume={abs/1607.00476} }