The graph theory is one among the most studied fields for research. There are several algorithms and concepts of graph theory, which is used to solve mathematical and real-world problems. Graph coloring is one of them. The graph coloring problem is a kind of NP-hard problem. Graph coloring has the capability of solving many optimization problems like air traffic management, train routes management, time table scheduling, register allocation in operating system, and many more. The vertex coloring problem can be defined if given a graph of vertices and edges; every vertex has to color in such a manner that two adjacent vertices should not have the same color, using the minimum number of colors. This paper introduced the implementation prospective of a vertex coloring algorithm based on k-colorability using recursive computation. Implemented algorithm is tested on DIMACS graph benchmarks. Result of novel method shows it has reduced execution time and improved chromatic number.
Vertex coloring problem Time complexity Chromatic number Graph coloring problem DIMACS Recursion
This is a preview of subscription content, log in to check access.
Gamache M, Hertz A, Ouellet JO (2007) A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Comput Oper Res 34(8):2384–2395CrossRefGoogle Scholar
Zufferey N, Amstutz P, Giaccari P (2008) Graph colouring approaches for a satellite range scheduling problem. J Sched 11(4):151–162MathSciNetCrossRefGoogle Scholar