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 research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.

This repository contains a Python implementation of a graph coloring solver using a Genetic Algorithm and a traditional Backtracking algorithm. The project is designed to find the minimum number of ...

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 ...