2 papers
math.CO2023
On 2-Distance ()-coloring of planar graphs with girth at least five
Zakir Deniz
A vertex coloring of a graph is called a 2-distance coloring if any two vertices at distance at most from each other receive different colors. Let be a planar graph wit…
math.CO2016
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…