This repository presents a hybrid approach combining Reinforcement Learning (RL) with the Tabucol, which is a version of tabu search specifically designed for the Graph Coloring Problem (GCP), ...

The Welsh-Powell algorithm is a greedy approach to graph vertex coloring. It sorts vertices by their degree in descending order and assigns the smallest possible color to each vertex that does not ...

Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...

Conflict-free colouring represents a rapidly evolving area of combinatorial optimisation with significant implications for both theoretical research and practical applications. In this framework, ...