FPT algorithms to recognize well covered graphs

Rafael Araujo, Eurinardo Costa, Sulamita Klein +2

Given a graph $G$, let $vc(G)$ and $v{c}^{+}(G)$ be the sizes of a minimum and a maximum minimal vertex covers of $G$, respectively. We say that $G$ is well covered if $vc(G)=v{c}^{+}(G)$…