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

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

The color palettes extracted from fine art paintings. The study of color is undergoing a revolution. Until now, color theory has been little more than a collection of ideas based loosely on science.