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

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems ...

In 1961, the French mathematician Claude Berge defined the notion of “perfect graphs” that behave particularly well with respect to a basic notion in graph theory called “colouring”.