On Minimum Dominating Sets in cubic and (claw,H)-free graphs

Valentin Bouquet, François Delbot, Christophe Picouleau +1

Given a graph $G=(V,E)$, $S\subseteq V$ is a dominating set if every $v\in V\setminus S$ is adjacent to an element of $S$. The Minimum Dominating Set problem asks for a dominating…