Percy John Heawood

New four-color theorem proof buys planar-graph insight with more computation

Six researchers spent nearly a decade building a third computer proof of the four-color theorem, one that runs longer than the proofs that came before it. Their return was a much faster coloring method plus new structure in planar graphs.