The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

This project implements six graph coloring algorithms — ranging from simple greedy heuristics to a customized, improved Genetic Algorithm (GA). The goal is to show how heuristic design strongly ...

Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...

This repository presents our work on solving the Graph Coloring Problem (GCP) using learning-based methods, graph-theoretic heuristics, and novel modeling strategies, particularly in the context of ...