A characterization of circle graphs in terms of multimatroid representations
arXiv: Combinatorics, 2017.
The isotropic matroid $M[IAS(G)]$ of a looped simple graph $G$ is a binary matroid, which is equivalent to the notion of isotropic system introduced by Bouchet. In general, $M[IAS(G)]$ is not regular, so it cannot be represented over fields of characteristic $neq 2$. The ground set of $M[IAS(G)]$ is denoted $W(G)$; it is partitioned into ...More
PPT (Upload PPT)