Minimally 3-connected isotropic systems

DOI10.1007/BF01212973zbMath0811.05021OpenAlexW2026944308MaRDI QIDQ1340133

L. Allys

Publication date: 3 May 1995

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212973

zbMATH Keywords

connectivitybinary matroidsminorsprime graphs4-regular graphsisotropic systems

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (5)

Isotropic matroids. III: Connectivity ⋮ Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs ⋮ A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors ⋮ Prime vertex-minors of a prime graph ⋮ Rank connectivity and pivot-minors of graphs

Cites Work

• Isotropic systems
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• Digraph Decompositions and Eulerian Systems
• Decomposition of Directed Graphs
• Connectivity in Matroids
• Unnamed Item

This page was built for publication: Minimally 3-connected isotropic systems