If G = (V, E) is a loop-free undirected graph, we call G color-critical if X(G - v) < X(G) for all v ∈ V. (We examined such graphs earlier, in Exercise 19 of Section 11.6.) Prove that a color-critical graph has no articulation points.