One of the great episodes in the history of mathematics began on October 23, 1852. In a letter to Sir William Rowan Hamilton, Augustus De Morgan wrote, “A student of mine asked me today to give him a ...

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

Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary vertex ...

Have you ever tried to do the brainteaser below, where you have to connect the dots to make the outline of a house in one continuous stroke without going back over your lines? Or perhaps you've ...

Fifty years ago, Paul Erdős and two other mathematicians came up with a graph theory problem that they thought they might solve on the spot. A team of mathematicians has finally settled it. In the ...

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