The structure of 3-connected matroids of path width three
From MaRDI portal
Publication:872056
DOI10.1016/J.EJC.2005.10.005zbMATH Open1117.05020OpenAlexW2156151648MaRDI QIDQ872056FDOQ872056
Rhiannon Hall, Charles Semple, James Oxley
Publication date: 27 March 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.10.005
Cites Work
- Title not available (Why is that?)
- A Combinatorial Decomposition Theory
- Connectivity in Matroids
- On the structure of 3-connected matroids and graphs
- The structure of the 3-separations of 3-connected matroids
- The structure of equivalent 3-separations in a 3-connected matroid
- Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids
Cited In (10)
- Outerplanar obstructions for matroid pathwidth
- An upgraded Wheels-and-Whirls theorem for 3-connected matroids
- The structure of the 3-separations of 3-connected matroids. II.
- Constructive characterizations of 3-connected matroids of path width three
- The excluded minors for 2- and 3-regular matroids
- \(N\)-detachable pairs in 3-connected matroids. I: Unveiling \(X\)
- On preserving matroid 3-connectivity relative to a fixed basis
- Outerplanar obstructions for matroid pathwidth
- An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
- Internally 4-connected binary matroids with cyclically sequential orderings
Recommendations
- Constructive characterizations of 3-connected matroids of path width three 👍 👎
- The structure of a 3-connected matroid with a 3-separating set of essential elements 👍 👎
- The structure of the 3-separations of 3-connected matroids. II. 👍 👎
- Matroid 4-connectivity: A deletion-contraction theorem 👍 👎
- Matroid 3-connectivity and branch width 👍 👎
This page was built for publication: The structure of 3-connected matroids of path width three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872056)
