Dual graph

Summary

The dual graph of a graph drawn in the plane has one vertex for each face of the drawing. It has one edge for each edge of the drawing, joining the two faces on its two sides. Duality exchanges faces and vertices, and cycles and minimal cuts. It depends on the chosen embedding, not only on the abstract graph, and the same idea works for graphs embedded in other surfaces.