Sibel Özkan

27 papers B 1C 2Journal 23Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes.
Contributions Discret. Math.
Fatih Yetgin, Ugur Odabasi, Sibel Özkan
2025 J jnl
The directed uniform Hamilton-Waterloo Problem involving even cycle sizes.
Discuss. Math. Graph Theory
Fatih Yetgin, Ugur Odabasi, Sibel Özkan
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
Efficient domination in Cayley graphs of generalized dihedral groups.
Discuss. Math. Graph Theory
Cafer Çaliskan, Stefko Miklavic, Sibel Özkan, Primoz Sparl
2022 J jnl
Triangle-free equimatchable graphs.
J. Graph Theory
Yasemin Büyükçolak, Sibel Özkan, Didem Gözüpek
2019 J jnl
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups.
Discret. Appl. Math.
Cafer Çaliskan, Stefko Miklavic, Sibel Özkan
2019 — conf
Edge-Critical Equimatchable Bipartite Graphs.
MACIS
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2019 J jnl
Maximum packings of inside perfect 8-cycle systems.
Australas. J Comb.
Selda Küçükçifçi, Charles Curtis Lindner, Sibel Özkan, Emine Sule Yazici
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
2017 J jnl
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
Theor. Comput. Sci.
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2017 J jnl
Uniformly Resolvable Cycle Decompositions with Four Different Factors.
Graphs Comb.
Ugur Odabasi, 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
2016 J jnl
On the Hamilton-Waterloo problem with triangle factors and C
Australas. J Comb.
John Asplund, David Kamin, Melissa S. Keranen, Adrián Pastine, Sibel Özkan
2016 B conf
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability.
WG
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016 J jnl
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability.
CoRR
Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom
2016 J jnl
The Hamilton-Waterloo Problem with C
Discret. Math.
Ugur Odabasi, Sibel Özkan
2015 C conf
An Extension of Dirac's Theorem on Hamiltonicity.
CTW
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan
2015 J jnl
Hall's theorem and extending partial latinized rectangles.
J. Comb. Theory A
John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Sibel Özkan
2015 C conf
The Hamilton-Waterloo Problem with C4 and Cm Factors.
CTW
Ugur Odabasi, Sibel Özkan
2013 J jnl
The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles.
Graphs Comb.
Melissa S. Keranen, Sibel Özkan
2011 J jnl
Generalization of the Erdos-Gallai Inequality.
Ars Comb.
Sibel Özkan
2010 J jnl
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves.
Discret. Math.
Sibel Özkan, C. A. Rodger
2009 J jnl
Hamilton decompositions of graphs with primitive complements.
Discret. Math.
Sibel Özkan, C. A. Rodger