7 citations · 20 across the 23 of their papers we have counts for
Showing 2016 · cs.DMShow all
3 papers · 2 filters
cs.DM2016★ 7 cited
Equimatchable Claw-Free Graphs
Saieed Akbari, Hadi Alizadeh, Tınaz Ekim +2
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, to t…
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…
cs.DM2016
Improper Twin Edge Coloring of Graphs
Paniz Abedin, Saieed Akbari, Marc Demange +1
Let be a graph whose each component has order at least 3. Let for some integer be an improper edge coloring of (where adjacent…