greedy coloring

Coloring vertices one at a time in some order, always giving each vertex the lowest-numbered color none of its already-colored neighbors is using.

Greedy coloring processes vertices in a fixed order, assigning each the smallest color not already used by an earlier-colored neighbor; it always uses at most $\Delta+1$ colors, but the order chosen affects how close it gets to $\chi(G)$ .