A decomposition theory for matroids. I: General results
From MaRDI portal
Publication:801076
DOI10.1016/0095-8956(85)90037-1zbMATH Open0551.05033OpenAlexW2073617714MaRDI QIDQ801076FDOQ801076
Authors: Klaus Truemper 
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
Recommendations
Cites Work
- Decomposition of regular matroids
- Kuratowski's and Wagner's theorems for matroids
- Title not available (Why is that?)
- A Combinatorial Decomposition Theory
- The dependence graph for bases in matroids
- Connectivity in Matroids
- Modular Constructions for Combinatorial Geometries
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- On matroid connectivity
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- Title not available (Why is that?)
- On the efficiency of representability tests for matroids
- Partial matroid representations
Cited In (30)
- Decomposition of 3-connected representable matroids
- Uniqueness of the decomposition of the rank function of a 2-polymatroid
- Decomposition of binary matroids
- Rank connectivity and pivot-minors of graphs
- Decomposition of 3-connected graphs
- A decomposition of the matroids with the max-flow min-cut property
- Obstacles to decomposition theorems for sixth-root-of-unity matroids
- Stability, fragility, and Rota's conjecture
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- A decomposition theory for matroids. IV: Decomposition of graphs
- Confinement of matroid representations to subsets of partial fields
- A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
- A decomposition theory for matroids. III. Decomposition conditions
- Title not available (Why is that?)
- Decomposition and optimization over cycles in binary matroids
- Title not available (Why is that?)
- A generalization of the theorem on forming a matroid from parts
- Title not available (Why is that?)
- Approximating clique-width and branch-width
- Rank-width and vertex-minors
- On Tutt's Characterization of graphic matroids—a graphic proof
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- A chain theorem for sequentially 3-rank-connected graphs with respect to vertex-minors
- An Obstacle to a Decomposition Theorem for Near-Regular Matroids
- The incidence structure of subspaces with well-scaled frames
- On the decomposition of vector spaces
- Title not available (Why is that?)
- Decomposition of binary signed-graphic matroids
- A Tutte decomposition for matrices and bimatroids
- A decomposition theory for matroids. II. Minimal violation matroids
This page was built for publication: A decomposition theory for matroids. I: General results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801076)
