Greedy coloring the vertices in the reverse of this removal ordering will automatically produce a coloring with at most colors, and for some graphs (such as complete graphs and odd-length cycle graphs) this number of colors is optimal.