6 papers · 1 filter
An improved bound for 2-distance coloring of planar graphs with girth six
Zakir Deniz
A vertex coloring of a graph is said to be a 2-distance coloring if any two vertices at distance at most from each other receive different colors, and the least number of c…
Critical Equimatchable Graphs
Zakir Deniz, Tınaz Ekim
A graph G is equimatchable if every maximal matching of G has the same cardinality. In this paper, we investigate equimatchable graphs such that the removal of any edge harms the e…
Sectionable Tournaments: Their topology and Coloring
Zakir Deniz
We provide a detailed study of topological and combinatorial properties of sectionable tournaments. This class forms an inductively constructed family of tournaments grounded over…
Order-sensitive domination in partially ordered sets
Yusuf Civan, Zakir Deniz, Mehmet Akif Yetim
For a (finite) partially ordered set (poset) , we call a dominating set in the comparability graph of , an order-sensitive dominating set in if either or els…
On graphs admitting two disjoint maximum independent sets
Zakir Deniz, Vadim E. Levit, Eugen Mandrescu
An independent set A is maximal if it is not a proper subset of an independent set, while A is maximum if it has a maximum size. The problem of whether a graph has a pair of disjoi…
On two extensions of equimatchable graphs
Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger +2
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two…