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

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

This repository contains the full codebase and documentation for the paper "Quantum-Assisted Graph Coloring: Solving the Graph Coloring Problem with Grover’s Algorithm in Qiskit" by Abde Manaaf ...

Abstract: The graph coloring problem is a classical NP-hard combinatorial optimization problem, which aims to assign distinct colors to connected nodes as much as possible. Currently, graph neural ...

ABSTRACT: The Total Coloring Conjecture (TCC) proposes that every simple graph G is (Δ + 2)-totally-colorable, where Δ is the maximum degree of G. For planar graph, TCC is open only in case Δ = 6. In ...

Abstract: Femtocell networks have great potential for mobile applications. However, interference due to the co-existence of macrocells and femtocells is a serious problem. In addition, dense ...