Graph Coloring · Challenge problem

Let $G$ be the graph on vertices $1,\ldots,9$ where $i$ and $j$ are adjacent exactly when their difference is $1$ or $2$, taken cyclically mod $9$ (so each vertex has degree $4$; e.g. vertex $1$ is adjacent to $2,3,8,9$). What is $\chi(G)$?