Hacker News new | ask | show | jobs
by ocfnash 3087 days ago
Just to advertise this addendum a bit more!

The Kempe-chain proof of the 5-colouring of any planar graph is easy and beautiful.