A decomposition theory for matroids. I: General results
From MaRDI portal
Publication:801076
DOI10.1016/0095-8956(85)90037-1zbMath0551.05033OpenAlexW2073617714MaRDI QIDQ801076
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(85)90037-1
Related Items (15)
Decomposition of 3-connected graphs ⋮ A decomposition theory for matroids. II. Minimal violation matroids ⋮ A decomposition theory for matroids. III. Decomposition conditions ⋮ Decomposition and optimization over cycles in binary matroids ⋮ A decomposition theory for matroids. IV: Decomposition of graphs ⋮ The incidence structure of subspaces with well-scaled frames ⋮ Confinement of matroid representations to subsets of partial fields ⋮ A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids ⋮ A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors ⋮ On Tutt's Characterization of graphic matroids—a graphic proof ⋮ Stability, fragility, and Rota's conjecture ⋮ Approximating clique-width and branch-width ⋮ A decomposition of the matroids with the max-flow min-cut property ⋮ Rank-width and vertex-minors ⋮ Rank connectivity and pivot-minors of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition of regular matroids
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Kuratowski's and Wagner's theorems for matroids
- The dependence graph for bases in matroids
- On the efficiency of representability tests for matroids
- Partial matroid representations
- A Combinatorial Decomposition Theory
- Modular Constructions for Combinatorial Geometries
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- Connectivity in Matroids
- On matroid connectivity
This page was built for publication: A decomposition theory for matroids. I: General results
