|
Given a graph, Naji describes a system of linear equations whose solvability determines whether or not the graph is a circle graph. We will sketch a new proof of this beautiful theorem which is considerably simpler than the existing proofs due to Naji, Gasse, and Traldi.
This is joint work with Jim Geelen.