Finding Efficient Domination for $P_8$-Free Bipartite Graphs in Polynomial Time

Andreas Brandstädt, Raffaele Mosca

A vertex set $D$ in a finite undirected graph $G$ is an {\em efficient dominating set} (\emph{e.d.s.}\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex o…