On graph classes with constant domination-packing ratio

Marthe Bonamy, Mónika Csikós, Anna Gujgiczer +1

The dominating number $\gamma (G)$ of a graph $G$ is the minimum size of a vertex set whose closed neighborhood covers all the vertices of the graph. The packing number $\rho (G)$ of $G$ is…