In each case, these simplified models display many of the issues that have to be handled in practice [REF].
For graphs G and H, the question of whether G → H holds corresponds to a CSP instance with only one kind of constraint, as follows: the variables are the vertices of G and the domain for each variable is the vertex set of H.