Whitney's Uniqueness Theorem for 3-Connected Graphs is a result in [matroid theory](/page/Matroid%20Theory). It formalizes the assertion that let and be finite connected graphs with at least four vertices and the same labelled edge set . If as matroids on , then and are isomorphic as labelled.