We give an overview of Tutte’s paper, “How to draw a graph”, that contains: (i) a proof that every simple 3-connected planar graph admits a straight-line embedding in the plane such that each face boundary is a convex polygon, (ii) an elegant algorithm for finding such an embedding, (iii) an algorithm for testing planarity, and (iv) a proof of Kuratowski’s theorem.
