Graph Homomorphism is a C123-problem, distinguishing between polynomial-time solvability and hardness in the polynomial hierarchy.
