Equimatchable Claw-Free Graphs
Discrete Mathematics
2018-07-26 v3 Combinatorics
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, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable claw-free graph families. This characterization implies an efficient recognition algorithm.
Cite
@article{arxiv.1607.00476,
title = {Equimatchable Claw-Free Graphs},
author = {Saieed Akbari and Hadi Alizadeh and Tınaz Ekim and Didem Gözüpek and Mordechai Shalom},
journal= {arXiv preprint arXiv:1607.00476},
year = {2018}
}