Improved Domination--Packing Bounds in Claw-Free Cubic Graphs and Unit Disk Graphs

Juan Gutiérrez, Kaustav Paul

Given a graph $G$, the domination number $\gamma (G)$ is the minimum cardinality of a dominating set in $G$, and the packing number $\rho (G)$ is the maximum cardinality of a set of vertices…