Gallai colorings and domination in multipartite digraphs

András Gyárfás, Gábor Simonyi, Ágnes Tóth

Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A_1,...,A_t of independent vertices. A set $U={\cup }_{i\in S}{A}_i$ is called a domin…