Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws

Michał Dębski, Zbigniew Lonc, Karolina Okrasa +2

For graphs $G$ and $H$, an $H$-coloring of $G$ is an edge-preserving mapping from $V(G)$ to $V(H)$. In the $H$-Coloring problem the graph $H$ is fixed and we ask whether an instanc…