Whitney's Planarity Criterion via Graphic Matroid Duals is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let be a finite connected graph, and let denote its cycle matroid on the ground set . Then is planar if and only if the dual matroid is graphic; equivalently, there exists a finite graph such that.