Planar Graphs · Special Layouts

Lesson 6

Nikolai Chukhin · Alexander S. Kulikov

For the curious 🤓
The just-proven theorem is a corollary of a more general result.

Theorem (Koebe—Andreev—Thurston). For any planar graph, one can assign each of its vertices a point in the plane and a circle centered at that point, such that any two circles intersect in at most one point and there is an edge between two vertices in the graph if and only if the corresponding two circles are tangent.