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

Have you ever tried to do a brainteaser in which 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 clicked on ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

Simon focuses on two challenging problems: Tarsi's Conjecture and Stanley's Tree Isomorphism Conjecture. Tarsi's Conjecture, a type of graph coloring problem, asks whether a special class of graphs ...

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

Four years ago, the mathematician Maria Chudnovsky faced an all-too-common predicament: how to seat 120 wedding guests, some of whom did not get along, at a dozen or so conflict-free tables. Luckily, ...