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.

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

A year after he started his Ph.D. in mathematics at McGill University, Matt Bowen had a problem. “I took my qualifying exams and did absolutely horribly on them,” he said. Bowen was sure that his ...

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

In just three pages, a Russian mathematician has presented a better way to color certain types of networks than many experts thought possible. A paper posted online last month has disproved a ...

Imagine you're a mapmaker, ready to finish your masterpiece map of the world. The only thing left to do is add the colors. But how many colors do you need for the countries if you want to make sure no ...

Embed <iframe src="https://www.npr.org/player/embed/4254287/4254288" width="100%" height="290" frameborder="0" scrolling="no" title="NPR embedded audio player"> NPR's ...

Earlier this week we looked at ways make basic contrast fixes in iPhoto’s histogram. Now that you know a bit about how the histogram works, you can tackle one of the most challenging image problems to ...