3 citations · 3 across the 1 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2018
Triangle-Free Equimatchable Graphs
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. [8] provided a characterization of equimatchable graphs with girth at least .…
cs.DM2017★ 3 cited
Minimum Reload Cost Cycle Cover in Complete Graphs
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al.[1]…