As an independent publication, we rely on readers like you to fund our journalism. If you value our coverage and want to support more of it, consider becoming a member today. Already a member? Sign in ...

If you want to understand society, look at the way it talks about hue, suggests a new tome from art historian Alexandra Loske. In the shadow of World War II, modern capitalism was beginning to take ...

Edge colouring is a fundamental concept in graph theory whereby colours are assigned to the edges of a graph such that no two adjacent edges share the same colour. This process is central to numerous ...

Conflict-free colouring represents a rapidly evolving area of combinatorial optimisation with significant implications for both theoretical research and practical applications. In this framework, ...

Sierpiftski graphs S(n,3) are the graphs of the Tower of Hanoi puzzle with n disks, while Sierpiftski gasket graphs Sn are the graphs naturally defined by the finite number of iterations that lead to ...

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...