Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs

Abstract

For a fixed graph $H$, by Hom($H$) we denote the computational problem which asks whether a given graph $G$ admits a homomorphism to $H$, i.e., an edge-preserving mapping from $V(G)$ to $V(H)$. As ...