The structure of the 3-separations of 3-connected matroids. II.
From MaRDI portal
Publication:875060
DOI10.1016/J.EJC.2006.01.007zbMATH Open1118.05012OpenAlexW2022922394MaRDI QIDQ875060FDOQ875060
Authors: Charles Semple, James Oxley, Geoff Whittle
Publication date: 10 April 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2006.01.007
Recommendations
Cites Work
Cited In (17)
- An upgraded Wheels-and-Whirls theorem for 3-connected matroids
- Crossing 3-separations in 3-connected matroids
- Decomposition of 3-connected representable matroids
- The 3-connected matroids with circumference 6
- The structure of the 3-separations of 3-connected matroids
- Exposing 3-separations in 3-connected matroids
- The structure of the 4-separations in 4-connected matroids
- The structure of 3-connected matroids of path width three
- Tangles, trees, and flowers
- An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid
- Wild triangles in 3-connected matroids
- A chain theorem for matroids
- Constructing a 3-tree for a 3-connected matroid
- Inequivalent representations of matroids over prime fields
- The structure of equivalent 3-separations in a 3-connected matroid
- On Seymour's decomposition theorem
- Isotropic matroids. III: Connectivity
This page was built for publication: The structure of the 3-separations of 3-connected matroids. II.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875060)