Graph Coloring · Hard problem

The path $1\text{-}2\text{-}3\text{-}4\text{-}5\text{-}6$ is colored greedily in the vertex order $1,6,2,5,3,4$ (each vertex gets the smallest color not used by an already-colored neighbour). How many colors are used?