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.

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

Graph reconfiguration and colouring problems investigate the transition between feasible solutions of a graph colouring instance. The central challenge is to determine a series of elementary vertex ...