| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777237 | Electronic Notes in Discrete Mathematics | 2016 | 4 Pages |
Abstract
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce three extensions of the property of equimatchability and present some initial structural and algorithmic insights about them.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger, Martin MilaniÄ, Mordechai Shalom,