I'm learning about the greedy algorithm, but this question is to general for me to grasp (I ave no idea where to begin). Could someone please explain how I solve the problem?
Show that for any graph $G$ there is an ordering of the vertices for which the greedy algorithm requires $χ(G)$ colors.