3 papers
math.CO2026
Packing chromatic critical graphs with radius at most 2
Aslıhan Gür, Didem Gözüpek, Hadi Alizadeh
For a graph with vertex set and a positive integer , an -packing in is a subset of such that the distance between any two distinct vertices of i…
math.CO2021
Upper paired domination versus upper domination
Hadi Alizadeh, Didem Gözüpek
A paired dominating set is a dominating set with the additional property that has a perfect matching. While the maximum cardainality of a minimal dominating set in a graph…
cs.DM2016
Equimatchable Claw-Free Graphs
Saieed Akbari, Hadi Alizadeh, Tınaz Ekim +2
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to t…