Solving the Wolverine Problem with Graph Coloring | Infinite Series

by Super User, 7 years ago
0 0
At one time, Wolverine served on four different superhero teams. How did he do it? He may have used graph coloring.

Tweet at us! @pbsinfinite
Facebook: series
Email us! pbsinfiniteseries [at] gmail [dot] com

Graph coloring may seem simple but the mathematics behind it is surprising difficult and it pops up in a number strange places. Kelsey discusses Sudoku, the Four Color Theorem, the Hadwiger Nelson Problem and how graph coloring can be used to schedule the most effective way to save the planet. Find out how math can defeat the combined might of Thanos, Magneto, Kang, Dormammu, Ultron, Apocalypse and Dr. Doom.

Previous Episode - What is a Random Walk?

Links to other resources:


General Applications:

Page on graph colorings:

Book on general graph theory:

The Four Color Theorem - Numberphile:

Written and Hosted by Kelsey Houston-Edwards
Produced by Rusty Ward
Graphics by Ray Lux
Made by Kornhaber Brown (

Comments answered by Kelsey:

Ofir David

Bertie Blue