Get started
Author

Sibel Özkan

Observed names: Sibel Ozkan, Özkan, Sibel
ORCID: 0000-0002-9547-7375
Observed ORCID: 0000-0002-9547-7375
OpenAlex ID: A5035377993
The Hamilton–Waterloo Problem with C4 and Cm factors
2015 · Uğur Odabaşı, Sibel Özkan · Discrete Mathematics · 17
PDF
The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles
2012 · Melissa S. Keranen, Sibel Özkan · Graphs and Combinatorics · 17
On the Hamilton-Waterloo Problem with triangle factors and $C_{3x}$-factors
2015 · Asplund, John, Kamin, David, et al. · arXiv (Cornell University) · 16
PDF
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
2017 · Didem Gözüpek, Sibel Özkan, et al. · Theoretical Computer Science · 9
PDF
On one extension of Dirac’s theorem on Hamiltonicity
2017 · Yasemin Büyükçolak, Didem Gözüpek, et al. · Discrete Applied Mathematics · 7
Efficient domination in Cayley graphs of generalized dihedral groups
2020 · Cafer Caliskan, Štefko Miklavič, et al. · Discussiones Mathematicae Graph Theory · 6
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups
2019 · Cafer Çalışkan, Štefko Miklavič, et al. · Discrete Applied Mathematics · 6
Hall's theorem and extending partial latinized rectangles
2014 · J.L. Goldwasser, A.J.W. Hilton, et al. · Journal of Combinatorial Theory Series A · 5
PDF
Triangle‐free equimatchable graphs
2021 · Yasemin Büyükçolak, Sibel Özkan, et al. · Journal of Graph Theory · 4
PDF
Hamilton decompositions of graphs with primitive complements
2008 · Sibel Ozkan, C.A. Rodger · Discrete Mathematics · 4
PDF
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability
2016 · Didem Gözüpek, Sibel Özkan, et al. · Lecture notes in computer science · 3
PDF
Equimatchable bipartite graphs
2020 · Yasemin Büyükçolak, Didem Gözüpek, et al. · Discussiones Mathematicae Graph Theory · 2
Uniformly Resolvable Cycle Decompositions with Four Different Factors
2017 · Uğur Odabaşı, Sibel Özkan · Graphs and Combinatorics · 2
On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes
2025 · Fatih Yetgin, Uğur Odabaşı, et al. · Contributions to Discrete Mathematics · 1
PDF
The directed uniform Hamilton-Waterloo Problem involving even cycle sizes
2024 · Fatih Yetgin, Uğur Odabaşi, et al. · Discussiones Mathematicae Graph Theory · 1
PDF
Uniform two‐class regular partial Steiner triple systems
2011 · Melissa S. Keranen, Donald L. Kreher, et al. · Journal of Combinatorial Designs · 1
The Hamilton–Waterloo Problem for Hamiltonian Cycles and Cm‐Factors
2026 · Mariusz Meszka, Sibel Özkan · Journal of Combinatorial Designs
PDF
Edge-Critical Equimatchable Bipartite Graphs
2020 · Yasemin Büyükçolak, Didem Gözüpek, et al. · Lecture notes in computer science
Maximum packings of inside perfect 8-cycle systems.
2019 · Selda Küçükçi̇fçi̇, Charles C. Lindner, et al. · Digital Collections portal (Koç University)
Almost 2-perfect 8-cycle systems
2017 · Küçükçifçi, Selda, Lindner, Charles Curtis, et al. · arXiv (Cornell University)
PDF
An Extension of Dirac's Theorem on Hamiltonicity.
2015 · Yasemin Büyükçolak, Didem Gözüpek, et al. · Cologne Twente Workshop on Graphs and Combinatorial Optimization
Generalization of the Erdos-Gallai Inequality.
2011 · Sibel Özkan · Ars Combinatoria
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves
2010 · Sibel Ozkan, C.A. Rodger · Discrete Mathematics
Works count: 23
Citation count: 101
H-index: 6
I10-index: 3
Year
Topic
Type