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

The Black and White Coloring (BWC) problem is initially described in 1. There is an undirected graph G = (V, E), where V is a set containing n vertices, and E is a set containing l edges. The vertices ...

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