@article {1509,
	title = {Equimatchable claw-free graphs},
	journal = {Discrete Mathematics},
	volume = {341},
	year = {2018},
	pages = {2859-2871},
	abstract = {<p>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.</p>},
	keywords = {Connectivity, Equimatchable graph, Factor-critical},
	issn = {0012-365X},
	doi = {https://doi.org/10.1016/j.disc.2018.06.043},
	url = {https://www.sciencedirect.com/science/article/pii/S0012365X18302140},
	author = {Saieed Akbari and Hadi Alizadeh and Ekim, Tinaz and Didem G{\"o}z{\"u}pek and Mordechai Shalom}
}
