Equimatchable claw-free graphs
From MaRDI portal
Publication:1660273
DOI10.1016/J.DISC.2018.06.043zbMATH Open1393.05203arXiv1607.00476OpenAlexW2460958546MaRDI QIDQ1660273
Author name not available (Why is that?)
Publication date: 15 August 2018
Published in: (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1607.00476
No records found.
No records found.
This page was built for publication: Equimatchable claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1660273)
