Research

Publications

1. Z. Deniz and H. Guler “A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable”, preprint, 2025. (arxiv)

2. Y. Civan, Z. Deniz, O. Duginov, and M. A. Yetim, "Chordal bipartite graphs, biclique vertex partitions and Castelnuovo-Mumford regularity of 1-subdivision graphs " preprint, 2024. (arxiv)

3. Z. Deniz, “A 2-Distance (2D+7)-coloring of planar graphs”, preprint, 2024. (arxiv)

4. Z. Deniz, “On 2-Distance (D+4)-coloring of planar graphs with girth at least five”, preprint, 2023. (arxiv)

5. Z. Deniz, “On 2-distance 16-coloring of planar graphs with maximum degree at most five”, Discrete Mathematics, 348(4), 114379, 2025. (arxiv) (journal)

6. Z. Deniz, “An improved bound for 2-distance coloring of planar graphs with girth six ”, Discrete Applied Mathematics,  361, 121-135, 2025. (arxiv) (journal)

7. Z. Deniz, “Some results on 2-distance coloring of planar graphs with girth five ”, Journal of Combinatorial Optimization,  47(4), 68, 2024. (arxiv) (journal)

8. Y. Civan, Z. Deniz and M. A. Yetim, "Gated independence in graphs " Discrete Applied Mathematics,  353, 121-138, 2024. (journal)

9. Z. Deniz and T. Ekim, “Critical equimatchable graphs”, Australasian Journal of Combinatorics, 88(2), 171-193, 2024. (arxiv) (journal)

10. Z. Deniz, “1-well-covered graphs containing a clique of size n/3”, Electronic Journal of Graph Theory and Applications, 12(2), 2024. (journal)

11. Z. Deniz, “Sectionable Tournaments: Their Topology and Coloring”, Order, 40(3), 469–491, 2023. (arxiv) (journal)

12. Y. Civan, Z. Deniz and M. A. Yetim, "Domination versus edge domination on claw-free graphs " Discrete Applied Mathematics, 337, 171-172, 2023. (journal)

13. Y. Civan, Z. Deniz and M. A. Yetim, “Order-sensitive domination in partially ordered sets”, Order, 40(1), 157–172, 2023. (arxiv) (journal)

14. Z. Deniz, V. E. Levit, and E. Mandrescu, "On graphs admitting two disjoint maximum independent sets",  The Art of Discrete and Applied Mathematics,  6, P1.01, 2023. (journal)

15. Z. Deniz, “On the well-coveredness of square graphs”, Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, 71(2), 490-501, 2022. (journal)

16. Z. Deniz, “A classification of 1-well-covered graphs”, Turkish Journal of Mathematics, 45, 2817-2829, 2021. (journal)

17. Z. Deniz, S. Nivelle, B. Ries and D. Schindl. “On some subclasses of split B1-EPG graphs”, Lecture Notes in Computer Science, 12118, 625-636, 2020. (journal)

18. Y. Civan, Z. Deniz and M. A. Yetim, “Bounding the chromatic number of squares of K4-minor-free graphs”, Discrete Mathematics, vol 342(7), 1894-1903, 2019. (journal)

19. Z. Deniz and T. Ekim, “Edge-stable equimatchable graphs”, Discrete Applied Mathematics, 261, 136-147, 2019. (arxiv) (journal)

20. Z. Deniz, E. Galby, A. Munaro and B. Ries. “On contact graphs of paths on a grid”, Lecture Notes in Computer Science, 11282, 317-330, 2018. (arxiv) (journal)

21. Z. Deniz, S. Nivelle, B. Ries and D. Schindl. “On Split B1-EPG Graphs”. Lecture Notes in Computer Science,  361-365, 2018. (journal)

22. Z. Deniz, T. Ekim, T. R. Hartinger, M. Milanic and M. Shalom, “On two extensions of equimatchable graphs”, Discrete Optimization, 26, 112-130, 2017. (arxiv) (journal) 

23. Z. Deniz, T. Ekim, T. R. Hartinger, M. Milanic and M. Shalom, “On three extensions of equimatchable graphs”. Electronic Notes in Discrete Mathematics, 55, 177-180, 2016. (journal)

24. Z. Deniz, “Topology of acyclic complexes of tournaments and coloring”, Applicable Algebra in Engineering, Communication and Computing,  26(1-2), 213-226, 2015. (local version) (journal)

Theses

• "Topology of acyclic complexes of tournaments, coloring and feedback numbers",  PhD Thesis, supervised by Yusuf Civan, Suleyman Demirel University, 2018.

• "Path matching in graphs and coloring", MSc Thesis, supervised by Yusuf Civan, Suleyman Demirel University, 2012.