This project, authored by AZIOUANE KHEDIDJA, implements a backtracking algorithm to perform graph coloring. Graph coloring is a classic problem in graph theory where the goal is to assign colors to ...
To solve the Graph Coloring Problem using backtracking, assigning colors to the vertices of a graph such that no two adjacent vertices share the same color while minimizing the number of colors used.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results