On the (parameterized) complexity of recognizing well-covered (r,l)-graphs

Sancrey R. Alves, Konrad K. Dabrowski, Luerbio Faria +3

An $(r,\ell )$-partition of a graph $G$ is a partition of its vertex set into $r$ independent sets and $\ell$ cliques. A graph is $(r,\ell )$ if it admits an $(r,\ell )$-partition.…