A complete bipartite graph is a graph with two sets of vertices where there is no edge between vertices belonging to the same set; but all vertices of different sets
Given any three tangent circles, there are exactly two other circles that are tangent to the three circles. Starting from three big tangent circles of the same size, use recursion