  The classical Whitney's 2-Isomorphism Theorem describes the families of
graphs having the same cycle matroid. In this paper we describe the families of
graphs having the same truncated cycle matroid and prove, in particular, that
every 3-connected graph, except for K4, is uniquely defined by its truncated
cycle matroid.
