Paper Title
Graph Coloring Algorithm

Graph coloring problem is to find the minimal number of colors to color nodes of a graph in such a way that every two nodes linked by an edge have different colors. A Novel Vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two nodes are to be allocated in same color if they are adjacent in graph. Graph coloring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. Keywords - Graph Coloring, Vertex Coloring