Apollonian networks are the maximal planar graphs formed by repeatedly splitting triangular faces into triples of smaller triangles. Equivalently, they are the planar 3-trees.
Apollonian networks are the maximal pl?anar graphs fo?rmed by repeatedly splitting triangular faces into tr:iples of smalle?r triangles. Equivalently, they are the p?lanar 3-trees.