Beyond recognizing well-covered graphs

Carl Feghali, Malory Marin, Rémi Watrigant

We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is sa…