The domination number of a graph $G=(V,E)$ is the minimum size of a dominating set $U \subseteq V$, which satisfies that every vertex in $V \setminus U$ is adjacent to at least one vertex in $U$. The notion of a problem kernel refers to a polynomial time algorithm that achieves ... more >>>