On Three Extensions of Equimatchable Graphs

详细信息    查看全文

• 作者：Zakir Deniz^a ; ^{zakirdeniz@sdu.edu.tr" class="auth_mail" title="E-mail the corresponding author} ; Tınaz Ekim^b ; ^{tinaz.ekim@boun.edu.tr" class="auth_mail" title="E-mail the corresponding author} ; Tatiana Romina Hartinger^c ; ^{tatiana.hartinger@iam.upr.si" class="auth_mail" title="E-mail the corresponding author} ; Martin Milanič^c ; ^{martin.milanic@upr.si" class="auth_mail" title="E-mail the corresponding author} ; Mordechai Shalom^d ; ^{cmshalom@telhai.ac.il" class="auth_mail" title="E-mail the corresponding author}
• 关键词：matching ; equimatchable graph ; greedy algorithm ; equimatchable set ; matching gap
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2016
• 出版时间：November 2016
• 年：2016
• 卷：55
• 期：Complete
• 页码：177-180
• 全文大小：164 K

文摘

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.