|
|||||
|
|
Equimatchable claw-free graphs |
|
| Authors: | Saieed Akbari Hadi Alizadeh T?naz Ekim Didem Gözüpek Mordechai Shalom |
| Institution: | 1. Department of Mathematical Sciences, Sharif University of Technology, 11155-9415, Tehran, Iran;2. Department of Computer Engineering, Gebze Technical University, Kocaeli, Turkey;3. Department of Industrial Engineering, Bogazici University, Istanbul, Turkey;4. TelHai Academic College, Upper Galilee, 12210, Israel |
| 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. |
| Keywords: | Equimatchable graph Factor-critical Connectivity |
| 本文献已被 ScienceDirect 等数据库收录！ | |