$(k,H)$-kernels in nearly tournaments

Hortensia Galeana-Sánchez, Miguel Tecpa-Galván

Let $H$ be a digraph possibly with loops, $D$ a digraph without loops, and $\rho :A(D)\to V(H)$ a coloring of $A(D)$ ($D$ is said to be an $H$-colored digraph). If $W=(x_{0},…