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.

Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems ...

Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns ...

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof. Four years ago, the mathematician Maria Chudnovsky faced an all-too ...

Researchers have created a new computing system that aims to tackle one of computing's hardest problems in a fraction of the time. Some problems are so challenging to solve that even the most advanced ...

As an undergraduate at the University of Chile, Bernardo Subercaseaux took a dim view of using computers to do math. It seemed antithetical to real intellectual discovery. “There’s some instinct or ...