Let $G = (V,E)$ be a finite, simple, undirected, connected graph, such that contracting an edge reduces the chromatic number. Does this imply that $G$ is complete?



Graphs such that contracting an edge decreases the chromatic number
Any odd cycle of length at least 5 is a counterexample.


