The Four-Color Theorem Gets a Rare New Proof | Quanta Magazine - Gregory Barber | By revisiting the famous problem — which was controversially solved in the 1970s with the help of computers — mathe...

The paper: The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, Mikkel Thorup arXiv:2603.24880 [math.CO]: arxiv.org/abs/2603.24880