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.

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

Here’s a scary scenario: You’ve been put in charge of air traffic control at Newark airport near New York. You need to make sure every plane can taxi between the runway and its gate without hitting ...

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