On Three Extensions of Equimatchable Graphs

DENİZ Z., EKİM T., Hartinger T. R., Milanič M., Shalom M.

Electronic Notes in Discrete Mathematics, cilt.55, ss.177-180, 2016 (Scopus)

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 55
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1016/j.endm.2016.10.044
  • Dergi Adı: Electronic Notes in Discrete Mathematics
  • Derginin Tarandığı İndeksler: Scopus
  • Sayfa Sayıları: ss.177-180
  • Anahtar Kelimeler: equimatchable graph, equimatchable set, greedy algorithm, matching, matching gap
  • Boğaziçi Üniversitesi Adresli: Evet

Özet

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.