Author(s): Ayushi Malviya, Bhawna Agrawal, Sanjeet Kumar and Akhlak Mansuri
Abstract: Graph coloring is an important area of mathematics and computer science. Graph coloring problem is getting more famous to solve the variety of real-world problems like map coloring, timetabling and scheduling. Graph coloring is allied with two types of coloring as vertex and edge coloring. Algorithm is a set of rules that must be followed when solving a particular coloring problem and algorithms plays an important role in graph coloring. The main objective of this paper is to study of various algorithms in graph coloring.