Abstract: The vertex-colouring problem is a well-known classical problem in graph theory in which a colour is assigned to each vertex of the graph such that no two adjacent vertices have the same ...