Reverse Coloring Algorithm

[JaredCrean2]

The current coloring algorithm always assigns the current element to the lowest possible color, leading to a situation where the last element usually needs to create a new color because all its neighbors already use the existing color. So the question becomes: is there some method or heuristic that would avoid this?

Possibly assigning elements to the largest existing color, rather the smallest would fix this?