Rainbow domination and related problems on some classes of perfect graphs

Wing-Kai Hon, Ton Kloks, Hsian-Hsuan Liu +1

Let $k\in \mathbb{N}$ and let $G$ be a graph. A function $f:V(G)\to 2^{[k]}$ is a rainbow function if, for every vertex $x$ with $f(x)=\varnothing$, $f(N(x))=[k]$. The ra…