Recognizing well-dominated graphs is coNP-complete

Akanksha Agrawal, Henning Fernau, Philipp Kindermann +2

A graph $G$ is well-covered if every minimal vertex cover of $G$ is minimum, and a graph $G$ is well-dominated if every minimal dominating set of $G$ is minimum. Studies on well-co…