A new characterization of graphic matroids

We give a necessary and sufficient condition for a binary matroid to be graphic. The condition is very natural, but, unlike other similar results, it gives a trivial algorithm for testing graphicness.