Yasemin Büyükçolak

According to our database, Yasemin Büyükçolak authored at least 9 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2025

Linear time algorithm for the vertex-edge domination problem in convex bipartite graphs.

Yasemin Büyükçolak

Discret. Optim., 2025

Well-indumatched Pseudoforests.

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan

Discret. Appl. Math., 2025

2023

Equimatchable bipartite graphs.

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan

Discuss. Math. Graph Theory, 2023

2022

Triangle-free equimatchable graphs.

Yasemin Büyükçolak, Sibel Özkan, Didem Gözüpek

J. Graph Theory, 2022

2019

Minimum reload cost cycle cover in complete graphs.

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan

Networks, 2019

On one extension of Dirac's theorem on Hamiltonicity.

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom

Discret. Appl. Math., 2019

Edge-Critical Equimatchable Bipartite Graphs.

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2016

A Simple Extension of Dirac's Theorem on Hamiltonicity.

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom

CoRR, 2016

2015

An Extension of Dirac's Theorem on Hamiltonicity.

Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015