Preprint
Oct 2026
Complexity, Bounds, and Exact Algorithms for Rainbow $k$-Domination in Regular Graphs
A rainbow $k$-dominating function assigns the empty set or exactly one of the colors $\{1\},\{2\},\ldots,\{k\}$ to each vertex of a simple graph in such a way that every vertex receiving $\emptyset$ sees all $k$ colors in its neighborhood. This model has several facility-location interpretations where colored vertices...
Piotr Lange
· 0 citations