default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSibel Özkan
Person information
- affiliation: Gebze Technical University, Department of Mathematics, Kocaeli, Turkey
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j17]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Well-indumatched Pseudoforests. Discret. Appl. Math. 361: 85-102 (2025)- 2023
- [j16]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Equimatchable bipartite graphs. Discuss. Math. Graph Theory 43(1): 77-94 (2023) - 2022
- [j15]Cafer Çaliskan, Stefko Miklavic, Sibel Özkan
, Primoz Sparl:
Efficient domination in Cayley graphs of generalized dihedral groups. Discuss. Math. Graph Theory 42(3): 823-841 (2022) - [j14]Yasemin Büyükçolak, Sibel Özkan, Didem Gözüpek:
Triangle-free equimatchable graphs. J. Graph Theory 99(3): 461-484 (2022)
2010 – 2019
- 2019
- [j13]Selda Küçükçifçi, Charles Curtis Lindner, Sibel Özkan, Emine Sule Yazici:
Maximum packings of inside perfect 8-cycle systems. Australas. J Comb. 75: 146-157 (2019) - [j12]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom:
On one extension of Dirac's theorem on Hamiltonicity. Discret. Appl. Math. 252: 10-16 (2019) - [j11]Cafer Çaliskan, Stefko Miklavic, Sibel Özkan:
Domination and efficient domination in cubic and quartic Cayley graphs on abelian groups. Discret. Appl. Math. 271: 15-24 (2019) - [j10]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Minimum reload cost cycle cover in complete graphs. Networks 74(3): 274-286 (2019) - [c2]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Edge-Critical Equimatchable Bipartite Graphs. MACIS 2019: 280-287 - 2018
- [i6]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Triangle-Free Equimatchable Graphs. CoRR abs/1807.09520 (2018) - 2017
- [j9]Ugur Odabasi, Sibel Özkan:
Uniformly Resolvable Cycle Decompositions with Four Different Factors. Graphs Comb. 33(6): 1591-1606 (2017) - [j8]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. Theor. Comput. Sci. 690: 91-103 (2017) - [i5]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Minimum Reload Cost Cycle Cover in Complete Graphs. CoRR abs/1706.05225 (2017) - 2016
- [j7]John Asplund, David Kamin, Melissa S. Keranen, Adrián Pastine, Sibel Özkan:
On the Hamilton-Waterloo problem with triangle factors and C3x-factors. Australas. J Comb. 64: 458-474 (2016) - [j6]Ugur Odabasi, Sibel Özkan:
The Hamilton-Waterloo Problem with C4 and Cm factors. Discret. Math. 339(1): 263-269 (2016) - [c1]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized Complexity of the MINCCA Problem on Graphs of Bounded Decomposability. WG 2016: 195-206 - [i4]Didem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom:
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability. CoRR abs/1605.00532 (2016) - [i3]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan, Mordechai Shalom:
A Simple Extension of Dirac's Theorem on Hamiltonicity. CoRR abs/1606.03687 (2016) - 2015
- [j5]John L. Goldwasser, Anthony J. W. Hilton, Dean G. Hoffman, Sibel Özkan:
Hall's theorem and extending partial latinized rectangles. J. Comb. Theory A 130: 26-41 (2015) - [i2]Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
An Extension of Dirac's Theorem on Hamiltonicity. CTW 2015: 149-152 - [i1]Ugur Odabasi, Sibel Özkan:
The Hamilton-Waterloo Problem with C4 and Cm Factors. CTW 2015: 239-241 - 2013
- [j4]Melissa S. Keranen, Sibel Özkan:
The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles. Graphs Comb. 29(6): 1827-1837 (2013) - 2011
- [j3]Sibel Özkan:
Generalization of the Erdos-Gallai Inequality. Ars Comb. 98: 295-302 (2011) - 2010
- [j2]Sibel Özkan, C. A. Rodger:
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves. Discret. Math. 310(13-14): 1965-1973 (2010)
2000 – 2009
- 2009
- [j1]Sibel Özkan, C. A. Rodger:
Hamilton decompositions of graphs with primitive complements. Discret. Math. 309(14): 4883-4888 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
