Given a planar graph G, a geometric dual graph and combinatorial dual graph can be defined. Whitney showed that these are equivalent, so that one may speak of "the" dual graph G^*. The illustration above shows the process of constructing a geometric dual graph.