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.

Four years ago, the mathematician Maria Chudnovsky faced an all-too-common predicament: how to seat 120 wedding guests, some of whom did not get along, at a dozen or so conflict-free tables. Luckily, ...

Graph colouring remains a central topic in graph theory, providing the mathematical framework for assigning colours to the elements of a graph under specific constraints. In particular, the colouring ...

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

constraint satisfaction problems, or CSPs for short, are a flexible approach to searching that have proven useful in many AI-style problems CSPs can be used to solve problems such as graph-coloring: ...

Have you ever tried to do the brainteaser below, where you have to connect the dots to make the outline of a house in one continuous stroke without going back over your lines? Or perhaps you've ...