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

In 1852, botanist Francis Guthrie noticed something peculiar as he was coloring a map of counties in England. Despite the counties’ meandering shapes and varied configurations, four colors were all he ...

Adjust the colors to reduce glare and give your eyes a break. Use one of the services below to sign in to PBS: You've just tried to add this video to My List. But first, we need you to sign in to PBS ...

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

A puzzle that has long flummoxed computers and the scientists who program them has suddenly become far more manageable. A new algorithm efficiently solves the graph isomorphism problem, computer ...