Graph Coloring with Minimum Colors: An Easy Approach

In this paper we introduce an approach for solving the graph coloring problem. The problem is a NP-complete problem and the complexities of almost all the available algorithms are very high. On the other hand, the algorithms that have lesser complexity, does not provide an optimal solution. In this paper, we put forth a technique for coloring a graph with minimum number of colors and in significantly lesser time than any other technique by processing the edge table we use to represent a graph.