Triangulated Planar

Some articles on triangulated planar, planar:

Circle Packing Theorem - A Uniqueness Statement
... A graph G is triangulated planar if it is planar and every connected component of the complement of the embedding of G in the sphere has precisely three edges on its boundary, or in other ... Any triangulated planar graph G is connected and simple, so the circle packing theorem guarantees the existence of a circle packing whose intersection graph is (isomorphic to) G ... As the following theorem states more formally, every maximal planar graph can have at most one packing ...