  We complete the characterization of the digraphs $D$ for which the induced
$D$-removal lemma has polynomial bounds, answering a question of Alon and
Shapira. We also study the analogous problem for $k$-colored complete graphs.
In particular, we prove a removal lemma with polynomial bounds for Gallai
colorings.
