New polynomial case for efficient domination in $P_6$-free graphs

T. Karthick

In a graph $G$, an {\it efficient dominating set} is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$. The {…