The goal is to figure out how to color the nodes of some network (or graph, as mathematicians call them) so that no two connected nodes share the same color. Depending on the context, such a coloring ...

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.

2-Distance Colouring: A colouring of a graph wherein vertices at distance up to two must receive distinct colours, adding a layer of complexity beyond traditional vertex colouring.

Graph Coloring and Chromatic Number Publication Trend The graph below shows the total number of publications each year in Graph Coloring and Chromatic Number.