Graph Coloring

To flex our encoding muscles, let's start with graph coloring:

• Given a graph and a set of colors, color all nodes, but no adjacent nodes can have the same color.

Example: $3\times3$ grid.

Can write this as a CSP? Need to know the variables, domains for the variables, and the constraint matrices.