Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs

Karolina Okrasa, Paweł Rzążewski

For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{H…