Fork-decompositions of matroids
From MaRDI portal
Publication:1883405
DOI10.1016/S0196-8858(03)00058-7zbMath1053.05024OpenAlexW2071164314MaRDI QIDQ1883405
Rhiannon Hall, Charles Semple, James G. Oxley, Geoffrey P. Whittle
Publication date: 12 October 2004
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0196-8858(03)00058-7
Related Items (5)
Outerplanar obstructions for matroid pathwidth ⋮ An upgraded Wheels-and-Whirls theorem for 3-connected matroids ⋮ Unnamed Item ⋮ The Structure of $\{U_{2,5}, U_{3,5}\}$-Fragile Matroids ⋮ Recent work in matroid representation theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple theorem on 3-connectivity
- Graph minors. X: Obstructions to tree-decomposition
- Branch-width and Rota's conjecture
- On the structure of 3-connected matroids and graphs
- Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids
- The excluded minors for GF(4)-representable matroids
- Matroid 4-connectivity: A deletion-contraction theorem
- Branch-width and well-quasi-ordering in matroids and graphs.
- On matroids of branch-width three.
- The structure of a 3-connected matroid with a 3-separating set of essential elements
- Inequivalent representations of matroids having no \(U_{3,6}\)-minor
- On inequivalent representations of matroids over finite fields
- On the Uniqueness of Matroid Representations Over GF(4)
- Graph minors. II. Algorithmic aspects of tree-width
- On the delta-wye reduction for planar graphs
- On a matroid generalization of graph connectivity
- Whitney Connectivity of Matroids
- Modular Constructions for Combinatorial Geometries
- Connectivity in Matroids
- On matroid connectivity
This page was built for publication: Fork-decompositions of matroids
