"Coin graph" redirects here. For contact graphs of equal-radius disks, see penny graph. A circle packing for a five-vertex planar graph The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann sur
![Circle packing theorem - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/fa7ced06f140a1f267e386761e411ab976bd27c2/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2Fa%2Fa0%2FCircle_packing_theorem_K5_minus_edge_example.svg%2F1200px-Circle_packing_theorem_K5_minus_edge_example.svg.png)