A Characterization of Graphic Matroids Based on Circuit Orderings
Donald K. Wagner · SIAM Journal on Discrete Mathematics · 2018
It is shown that a binary matroid is graphic if and only if it does not contain a cyclically ordered circuit and two cocircuits that interact in a particular way. This result generalizes a theorem of Došen and Petrić for planar graphs.