An Approach to Solve Graph Coloring Problem Using Linked List

5 Pages Posted: 12 Feb 2019

See all articles by Ajay Narayan Shukla

Ajay Narayan Shukla

DIT University, Dehradun

M.L. Garg

DIT University, Dehradun

Rajiv Misra

Indian Institute of Technology (IIT), Patna

Date Written: February 10, 2019

Abstract

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. The processes of assigning the colors in the graph will in a manner such that that the total number of different colors used is minimum. Most of the existing algorithms generally deal this problem by taking consideration above constraint during assigning the color to vertices in the graph, but some time above explicit constraints creates implicit constraints which increases the complexity of the algorithms. In this paper we propose an algorithm for graph coloring problem by using adjacency list which assign the colors to vertices of the graph with minimum number of colors and without creating any implicit constraint in the coloring process.

Keywords: Graph Coloring, implicit constraints, explicit constraints

Suggested Citation

Shukla, Ajay Narayan and Garg, M.L. and Misra, Rajiv, An Approach to Solve Graph Coloring Problem Using Linked List (February 10, 2019). International Journal of Advanced Studies of Scientific Research, Vol. 4, No. 2, 2019, Available at SSRN: https://ssrn.com/abstract=3331930

Ajay Narayan Shukla (Contact Author)

DIT University, Dehradun ( email )

Dehradun
Uttarakhand
India

M.L. Garg

DIT University, Dehradun ( email )

Dehradun
Uttarakhand
India

Rajiv Misra

Indian Institute of Technology (IIT), Patna ( email )

Navin Government Polytechnic Campus
Patliputra Colony
Patna, Bihar 800 013
India

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
249
Abstract Views
828
Rank
252,413
PlumX Metrics