Equimatchable claw-free graphs
| Başlık | Equimatchable claw-free graphs |
| Publication Type | Journal Article |
| Year of Publication | 2018 |
| Authors | Akbari, S., H. Alizadeh, T. Ekim, D. Gözüpek, and M. Shalom |
| Journal | Discrete Mathematics |
| Volume | 341 |
| Pagination | 2859-2871 |
| ISSN | 0012-365X |
| Anahtar kelimeler | Connectivity, Equimatchable graph, Factor-critical |
| 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. |
| URL | https://www.sciencedirect.com/science/article/pii/S0012365X18302140 |
| DOI | 10.1016/j.disc.2018.06.043 |
