Showing 2016Show all
2 papers · 1 filter
math.CO2016
On two extensions of equimatchable graphs
Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger +2
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two…
cs.DM2016
Edge-Stable Equimatchable Graphs
Zakir Deniz, Tınaz Ekim
A graph is \emph{equimatchable} if every maximal matching of has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the…