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

In the fall of 1972, Vance Faber was a new professor at the University of Colorado. When two influential mathematicians, Paul Erdős and László Lovász, came for a visit, Faber decided to host a tea ...