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

This is a preview. Log in through your library . Abstract This paper describes the application of a vertex coloring procedure to a real life examination scheduling problem. The accessories used in ...

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

Let G = (V, E) be a strongly connected, aperiodic, directed graph having outdegree 2 at each vertex. A red-blue coloring of G is a coloring of the edges with the colors red and blue such that each ...

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

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

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

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

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