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

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.

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...