Hamilton decompositions of graphs with primitive complements. - Sibel Özkan; C. A. Rodger (Discret. Math., 2009)

Hamilton decompositions of balanced complete multipartite graphs with primitive leaves. - Sibel Özkan; C. A. Rodger (Discret. Math., 2010)

Generalization of the Erdos-Gallai Inequality. - Sibel Özkan (Ars Comb., 2011)

The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles. - Melissa S. Keranen; Sibel Özkan (Graphs Comb., 2013)

An Extension of Dirac's Theorem on Hamiltonicity. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (CTW, 2015)

The Hamilton-Waterloo Problem with C4 and Cm Factors. - Ugur Odabasi; Sibel Özkan (CTW, 2015)

Hall's theorem and extending partial latinized rectangles. - John L. Goldwasser; Anthony J. W. Hilton; Dean G. Hoffman; Sibel Özkan (J. Comb. Theory A, 2015)

On the Hamilton-Waterloo problem with triangle factors and C3x-factors. - John Asplund; David Kamin; Melissa S. Keranen; Adrián Pastine; Sibel Özkan (Australas. J Comb., 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)

The Hamilton-Waterloo Problem with C4 and Cm factors. - Ugur Odabasi; Sibel Özkan (Discret. Math., 2016)

Uniformly Resolvable Cycle Decompositions with Four Different Factors. - Ugur Odabasi; Sibel Özkan (Graphs Comb., 2017)

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. - Didem Gözüpek; Sibel Özkan; Christophe Paul; Ignasi Sau; Mordechai Shalom (Theor. Comput. Sci., 2017)

Edge-Critical Equimatchable Bipartite Graphs. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (MACIS, 2019)

Maximum packings of inside perfect 8-cycle systems. - Selda Küçükçifçi; Charles Curtis Lindner; Sibel Özkan; Emine Sule Yazici (Australas. J Comb., 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)

Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups. - Cafer Çaliskan; Stefko Miklavic; Sibel Özkan (Discret. Appl. Math., 2019)

Minimum reload cost cycle cover in complete graphs. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (Networks, 2019)

Efficient domination in Cayley graphs of generalized dihedral groups. - Cafer Çaliskan; Stefko Miklavic; Sibel Özkan; Primoz Sparl (Discuss. Math. Graph Theory, 2022)

Triangle-free equimatchable graphs. - Yasemin Büyükçolak; Sibel Özkan; Didem Gözüpek (J. Graph Theory, 2022)

Equimatchable bipartite graphs. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (Discuss. Math. Graph Theory, 2023)

Well-indumatched Pseudoforests. - Yasemin Büyükçolak; Didem Gözüpek; Sibel Özkan (Discret. Appl. Math., 2025)

The directed uniform Hamilton-Waterloo Problem involving even cycle sizes. - Fatih Yetgin; Ugur Odabasi; Sibel Özkan (Discuss. Math. Graph Theory, 2025)