Planar Duality for Graphic Matroids is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite connected plane graph with planar dual graph . Under the natural bijection between edges of and edges of , \begin{align } M(G)^ \cong M(G^\dagger). \end{align.