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: Coloring a graph is a known and a classical problem in graph theory. It is also a known NP problem. In a graph G, the solution of coloring a graph is about coloring all the vertices of the ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

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

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...