  We present a new proof of an algebraic characterization of circle graphs due
to W. Naji. For bipartite graphs, Naji's theorem is equivalent to an algebraic
characterization of planar matroids due to J. Geelen and B. Gerards. Naji's
theorem also yields an algebraic characterization of permutation graphs.
