$k$-colored kernels in semicomplete multipartite digraphs

Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros

An $m$-colored digraph $D$ has $k$-colored kernel if there exists a subset $K$ of its vertices such that for every vertex $v\notin K$ there exists an at most $k$-colored directed…