The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

In particular, the colouring of planar graphs—those which can be depicted on a plane without edge intersections—has attracted sustained attention due to its combinatorial complexity and ...

Perfect graphs are, by definition, colorable with the most limited palette possible. When coloring a graph, every node in a mutually connected cluster, or “clique,” must receive a distinct ...