The L(2, 1)-coloring number also called as Chromatic number λ(G) of graph G is the smallest number k such that G has an L(2, 1)-coloring with max f(v): v ϵ V(G) = k. In this paper, four algorithms are ...