If $\chi(G)$ is finite, and all maximal cliques have size at least 3, you may take a graph coloring and unite two colors. This gives a proper coloring of the maximal cliques hypergraph with strictly less than $\chi(G)$ colors.