Minimally 3-connected isotropic systems (Q1340133)

Isotropic systems are structures which unify some properties of 4-regular graphs and self-dual properties of binary matroids, such as connectivity and minors. In this paper, the minimally 3-connected isotropic systems are found; they are exactly the cyclic isotropic systems (Lemma 4.2 and Theorem 4.3). The author shows also that such a system \(S = (L,V)\) is bipartite if and only if the number of vertices, \(| V |\), is even. An application to prime graphs is given at the end of the paper.