We prove that computing the group chromatic number of graphs is complete for the class at the second level of the polynomial hierarchy.
