A circuit characterization of graphic matroids

It is shown that a binary matroid is graphic if and only if it does not contain four circuits that interact is a particular way. This result generalizes a theorem of Little and Sanjith for planar graphs.