The complexity of the bondage problem in planar graphs

Valentin Bouquet

A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Let $\gamma (G)$ be the cardinality of a minimum dominating set in $G$.…