Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...

Combinatorial optimization underpins applications in artificial intelligence, logistics, and network design, yet classical techniques such as greedy search and dynamic programming struggle to balance ...