pith. sign in

arxiv: 1607.00476 · v3 · pith:WMRHJ2VWnew · submitted 2016-07-02 · 💻 cs.DM · math.CO

Equimatchable Claw-Free Graphs

Saieed Akbari , Hadi Alizadeh , T{\i}naz Ekim , Didem G\"oz\"upek , Mordechai Shalom This is my paper
classification 💻 cs.DM math.CO
keywords claw-freeequimatchablegraphcharacterizationgraphsalgorithmbestclaw
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.