INPUTS ARE
N is          6
LOWERBOUND is         3
         1         2         3         4         5         6
         3         2         4         5
         4         1         6         5         3
         2         2         6
         2         5         1
         4         4         2         1         6
         3         2         3         5

OUTPUTS ARE
 number of forward steps performed by the algorithm is          8
color of vertex I in the optimal graph coloring is

GR[ 1] ==          1
GR[ 2] ==          2
GR[ 3] ==          1
GR[ 4] ==          2
GR[ 5] ==          3
GR[ 6] ==          4
