Graph-Theory on danilchenko.devhttps://www.danilchenko.dev/tags/graph-theory/Recent content in Graph-Theory on danilchenko.devHugoen-usMon, 30 Mar 2026 06:00:00 +0000The Four Color Theorem Now Runs in Near-Linear Time — First Improvement in 30 Yearshttps://www.danilchenko.dev/posts/2026-03-30-four-color-theorem-near-linear-time-algorithm/Mon, 30 Mar 2026 06:00:00 +0000https://www.danilchenko.dev/posts/2026-03-30-four-color-theorem-near-linear-time-algorithm/A new paper by Kawarabayashi, Thorup, Mohar, and Thomassen gives an O(n log n) algorithm for 4-coloring planar graphs, breaking a 30-year quadratic barrier.