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

This research topic explores the theoretical foundations and practical applications of graph labeling and coloring problems, both of which are central to modern combinatorics and computer science.

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

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

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