Let G be a graph and V1, ..., Un a node enumeration. With A we denote the following algorithm to color the nodes: Color the nodes V1, ..., Un in sequence with the smallest possible natural number. Give an order of the nodes so that one needs exactly x(G) colors with this algorithm