Circle packing theorem - Wikipedia"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
