Back to Search
Start Over
Equimatchable claw-free graphs.
- Source :
-
Discrete Mathematics . Oct2018, Vol. 341 Issue 10, p2859-2871. 13p. - Publication Year :
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH theory
*MATCHING theory
*ALGORITHMS
*DISCRETE systems
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 341
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 131251885
- Full Text :
- https://doi.org/10.1016/j.disc.2018.06.043