Equimatchable Claw-Free Graphs

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.

Extracted Key Phrases

2 Figures and Tables

Showing 1-10 of 20 references

Equimatchable factor-critical graphs

  • O Favaron
  • 1986
Highly Influential
3 Excerpts

Equimatchable factor-critical graphs and independence number 2

  • E Eiben, M Kotrbčík
  • 2015
2 Excerpts