default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZakir Deniz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j12]Zakir Deniz
:
An improved bound for 2-distance coloring of planar graphs with girth six. Discret. Appl. Math. 361: 121-135 (2025)- 2024
- [j11]Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim:
Gated independence in graphs. Discret. Appl. Math. 353: 121-138 (2024) - [j10]Zakir Deniz:
Some results on 2-distance coloring of planar graphs with girth five. J. Comb. Optim. 47(4): 68 (2024) - 2023
- [j9]Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim:
Domination versus edge domination on claw-free graphs. Discret. Appl. Math. 337: 171-172 (2023) - [j8]Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim:
Order-Sensitive Domination in Partially Ordered Sets and Graphs. Order 40(1): 157-172 (2023) - [j7]Zakir Deniz:
Sectionable Tournaments: their Topology and Coloring. Order 40(3): 469-491 (2023) - 2022
- [j6]Zakir Deniz, Vadim E. Levit, Eugen Mandrescu:
On graphs admitting two disjoint maximum independent sets. Art Discret. Appl. Math. 6(1): 1 (2022) - 2020
- [c3]Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Some Subclasses of Split B1-EPG Graphs. LATIN 2020: 625-636 - [i4]Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim:
Order-sensitive domination in partially ordered sets. CoRR abs/2007.04715 (2020)
2010 – 2019
- 2019
- [j5]Zakir Deniz, Tínaz Ekim:
Edge-stable equimatchable graphs. Discret. Appl. Math. 261: 136-147 (2019) - [j4]Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim:
Bounding the chromatic number of squares of K4-minor-free graphs. Discret. Math. 342(7): 1894-1903 (2019) - 2018
- [c2]Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries:
On Contact Graphs of Paths on a Grid. GD 2018: 317-330 - [c1]Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl:
On Split B_1 B 1 -EPG Graphs. LATIN 2018: 361-375 - [i3]Zakir Deniz, Esther Galby, Bernard Ries:
On contact graphs of paths on a grid. CoRR abs/1803.03468 (2018) - [i2]Zakir Deniz, Vadim E. Levit, Eugen Mandrescu:
On graphs admitting two disjoint maximum independent sets. CoRR abs/1807.06914 (2018) - 2017
- [j3]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On two extensions of equimatchable graphs. Discret. Optim. 26: 112-130 (2017) - 2016
- [j2]Zakir Deniz, Tínaz Ekim, Tatiana Romina Hartinger, Martin Milanic, Mordechai Shalom:
On Three Extensions of Equimatchable Graphs. Electron. Notes Discret. Math. 55: 177-180 (2016) - [i1]Zakir Deniz, Tínaz Ekim:
Stable Equimatchable Graphs. CoRR abs/1602.09127 (2016) - 2015
- [j1]Zakir Deniz:
Topology of acyclic complexes of tournaments and coloring. Appl. Algebra Eng. Commun. Comput. 26(1-2): 213-226 (2015)
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-07 20:32 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:
