Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond

Tesshu Hanaka, Hirotaka Ono, Yota Otachi +1

A dominating set $S$ of graph $G$ is called an $r$-grouped dominating set if $S$ can be partitioned into $S_1,S_2,\dots ,S_k$ such that the size of each unit $S_i$ is $r$ and the s…