The structure of the 4-separations in 4-connected matroids
From MaRDI portal
Publication:651044
DOI10.1016/J.AAM.2011.06.001zbMATH Open1253.05056OpenAlexW2089753579MaRDI QIDQ651044FDOQ651044
Authors: Jeremy Aikin, James Oxley
Publication date: 8 December 2011
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2011.06.001
Recommendations
Cites Work
Cited In (12)
- Crossing 3-separations in 3-connected matroids
- The structure of 4-flowers of vertically 4-connected matroids
- The structure of the 3-separations of 3-connected matroids
- The structure of the 3-separations of 3-connected matroids. II.
- Tangles, trees, and flowers
- An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
- Relaxations of \(\mathrm{GF}(4)\)-representable matroids
- Matroid 4-connectivity: A deletion-contraction theorem
- A separation theorem for totally-sewn 4-polytopes
- The structure of equivalent 3-separations in a 3-connected matroid
- On matroid separations of graphs
- A Connection Problem for Simpson's Even Family of Rank Four
This page was built for publication: The structure of the 4-separations in 4-connected matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651044)