A List based Approach to Solve Graph Coloring Problem

In this paper we present a list based solution to the graph coloring problem which is simple & efficient. The proposed algorithm may be applied either on dense graph or sparse graph for coloring the node without affecting its complexity. For given an undirected graph G= (V,E) the graph coloring problem consist in assigning a color to each vertex in such a manner that no two adjacent vertex have same color. In most of the algorithms researchers focused to deal the problem by considering only constraints given in the problem. But during coloring of the nodes in the graph, some constraints may generated, which required to be handled explicitly. Our proposed algorithm deals this problem carefully and assigning of colors to vertices will done in such a manner that without generating any other constraints the graph can be colored efficiently.