Efficient Domination for Some Subclasses of $P_6$-Free Graphs in Polynomial Time

Andreas Brandstädt, Elaine M. Eschen, Erik Friese

Let $G$ be a finite undirected graph. A vertex {\em dominates} itself and all its neighbors in $G$. A vertex set $D$ is an {\em efficient dominating set} (\emph{e.d.}\ for short) o…