Loading...
- Type of Document: Article
- DOI: 10.1016/j.disc.2018.06.043
- Publisher: Elsevier B.V , 2018
- 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. © 2018 Elsevier B.V
- Keywords:
- Connectivity ; Equimatchable graph ; Factor-critical
- Source: Discrete Mathematics ; Volume 341, Issue 10 , 2018 , Pages 2859-2871 ; 0012365X (ISSN)
- URL: https://www.sciencedirect.com/science/article/abs/pii/S0012365X18302140