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.
Recommendations
Cites work
Cited in
(10)- Isotropic systems
- Graphic presentations of isotropic systems
- Tutte-Martin polynomials and orienting vectors of isotropic systems
- Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs
- Rank connectivity and pivot-minors of graphs
- Isotropic matroids. III: Connectivity
- scientific article; zbMATH DE number 15493 (Why is no real title available?)
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
- Prime vertex-minors of a prime graph
- Vertex-minors of graphs: a survey
This page was built for publication: Minimally 3-connected isotropic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340133)
