Recognizing k-equistable graphs in FPT time

Eun Jung Kim, Martin Milanic, Oliver Schaudt

A graph $G=(V,E)$ is called equistable if there exist a positive integer $t$ and a weight function $w:V\to \mathbb{N}$ such that $S\subseteq V$ is a maximal stable set of $G$…