De Grey pitched the problem of finding the minimal five-color graph to Terence Tao, a mathematician at the University of California, Los Angeles, as a potential Polymath problem. Polymath began about ...

The graph below shows the total number of publications each year in Graph Reconfiguration and Coloring Problems. References [1] Strong inequalities and a branch-and-price algorithm for the convex ...

b-Colouring: A vertex colouring of a graph where, in each colour class, there exists at least one vertex (b-vertex) that is adjacent to vertices in all other colour classes.