Yasemin Büyükçolak

12 papers C 1Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs.
Discret. Optim.
Yasemin Büyükçolak
2025 J jnl
On Well-VE-Dominated Graphs.
CoRR
Yasemin Büyükçolak
2025 J jnl
Well-indumatched Pseudoforests.
Discret. Appl. Math.
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2023 J jnl
Equimatchable bipartite graphs.
Discuss. Math. Graph Theory
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2022 J jnl
Triangle-free equimatchable graphs.
J. Graph Theory
Yasemin Büyükçolak, Sibel Özkan, Didem Gözüpek
2019 — conf
Edge-Critical Equimatchable Bipartite Graphs.
MACIS
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2019 J jnl
Minimum reload cost cycle cover in complete graphs.
Networks
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2019 J jnl
On one extension of Dirac's theorem on Hamiltonicity.
Discret. Appl. Math.
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
2018 J jnl
Triangle-Free Equimatchable Graphs.
CoRR
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2017 J jnl
Minimum Reload Cost Cycle Cover in Complete Graphs.
CoRR
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2016 J jnl
A Simple Extension of Dirac's Theorem on Hamiltonicity.
CoRR
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom
2015 C conf
An Extension of Dirac's Theorem on Hamiltonicity.
CTW
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan