Topology of acyclic complexes of tournaments and coloring. - Zakir Deniz (Appl. Algebra Eng. Commun. Comput., 2015)

Stable Equimatchable Graphs. - Zakir Deniz; Tínaz Ekim (CoRR, 2016)

On Three Extensions of Equimatchable Graphs. - Zakir Deniz; Tínaz Ekim; Tatiana Romina Hartinger; Martin Milanic; Mordechai Shalom (Electron. Notes Discret. Math., 2016)

On two extensions of equimatchable graphs. - Zakir Deniz; Tínaz Ekim; Tatiana Romina Hartinger; Martin Milanic; Mordechai Shalom (Discret. Optim., 2017)

On Contact Graphs of Paths on a Grid. - Zakir Deniz; Esther Galby; Andrea Munaro; Bernard Ries (GD, 2018)

On Split B_1 B 1 -EPG Graphs. - Zakir Deniz; Simon Nivelle; Bernard Ries; David Schindl (LATIN, 2018)

On contact graphs of paths on a grid. - Zakir Deniz; Esther Galby; Bernard Ries (CoRR, 2018)

Edge-stable equimatchable graphs. - Zakir Deniz; Tínaz Ekim (Discret. Appl. Math., 2019)

Bounding the chromatic number of squares of K4-minor-free graphs. - Yusuf Civan; Zakir Deniz; Mehmet Akif Yetim (Discret. Math., 2019)

On Some Subclasses of Split B1-EPG Graphs. - Zakir Deniz; Simon Nivelle; Bernard Ries; David Schindl (LATIN, 2020)

Order-sensitive domination in partially ordered sets. - Yusuf Civan; Zakir Deniz; Mehmet Akif Yetim (CoRR, 2020)

On graphs admitting two disjoint maximum independent sets. - Zakir Deniz; Vadim E. Levit; Eugen Mandrescu (Art Discret. Appl. Math., 2022)

Order-Sensitive Domination in Partially Ordered Sets and Graphs. - Yusuf Civan; Zakir Deniz; Mehmet Akif Yetim (Order, 2023)

Domination versus edge domination on claw-free graphs. - Yusuf Civan; Zakir Deniz; Mehmet Akif Yetim (Discret. Appl. Math., 2023)

Sectionable Tournaments: their Topology and Coloring. - Zakir Deniz (Order, 2023)

Gated independence in graphs. - Yusuf Civan; Zakir Deniz; Mehmet Akif Yetim (Discret. Appl. Math., 2024)

1-well-covered graphs containing a clique of size n∕3. - Zakir Deniz (Electron. J. Graph Theory Appl., 2024)

Some results on 2-distance coloring of planar graphs with girth five. - Zakir Deniz (J. Comb. Optim., 2024)

An improved bound for 2-distance coloring of planar graphs with girth six. - Zakir Deniz (Discret. Appl. Math., 2025)

On 2-distance 16-coloring of planar graphs with maximum degree at most five. - Zakir Deniz (Discret. Math., 2025)