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

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

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.

Imagine you are planning a banquet. You want to make sure that if two people don't like each other, they don't sit at the same table. To help with planning, you might draw a diagram with dots for ...

The graph colouring problem, a classic NP-hard challenge, is central to many practical applications such as scheduling, resource allocation and network management. Recent advances have seen the ...

Among the 23 remarkable individuals who won MacArthur Foundation fellowships earlier this week, there was mathematician Maria Chudnovsky, who is married to a violist, and stringed instrument bow-maker ...