On the complexity of $\mathbb{H}$-coloring for special oriented trees

Jakub Bulín

For a fixed digraph $\mathbb{H}$, the $\mathbb{H}$-coloring problem is the problem of deciding whether a given input digraph $\mathbb{G}$ admits a homomorphism to $\mathbb{H}$. The CSP…