Decomposition of regular matroids
From MaRDI portal
Cites work
- A Combinatorial Model for Series-Parallel Networks
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Connectivity in Matroids
- scientific article; zbMATH DE number 3133252 (Why is no real title available?)
- scientific article; zbMATH DE number 3719168 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3598496 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- Kuratowski's and Wagner's theorems for matroids
- Matroids and Graphs
- Matroids and multicommodity flows
- Modular Constructions for Combinatorial Geometries
- On Tutte's Characterization of Graphic Matroids
- On Tutte's extension of the four-colour problem
Cited in
(only showing first 100 items - show all)- Removing circuits in 3-connected binary matroids
- The decomposition of the hypermetric cone into \(L\)-domains
- On clone sets of \(GF(q)\)-representable matroids
- The 3-connected binary matroids with circumference 6 or 7
- On the representability of totally unimodular matrices on bidirected graphs
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- On theories of Whitney and Tutte
- A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
- Minors of 3-connected matroids
- Polyhedral proof methods in combinatorial optimization
- Semi-duality and the cycle double cover conjecture
- A decomposition theory for matroids. II. Minimal violation matroids
- A decomposition theory for matroids. III. Decomposition conditions
- Triples in matroid circuits
- On chains of 3-connected matroids
- Decomposition and optimization over cycles in binary matroids
- On ternary transversal matroids
- Adjacency in binary matroids
- Short cocircuits in binary matroids
- A construction for binary matroids
- Recognizing max-flow min-cut path matrices
- A decomposition theory for matroids. V: Testing of matrix total unimodularity
- Strong unimodularity for matrices and hypergraphs
- Optima of dual integer linear programs
- Chordal characterization of graphic matroids
- The incidence structure of subspaces with well-scaled frames
- A characterization of a class of non-binary matroids
- Directed submodularity, ditroids and directed submodular flows
- Turán's triangle theorem and binary matroids
- On 3-connected matroids
- Recognizing claw-free perfect graphs
- Star-cutsets and perfect graphs
- Subspaces with well-scaled frames
- A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
- Large circuits in binary matroids of large cogirth. I
- Algebraic flows in regular matroids
- Complement total unimodularity
- On Tutte's extension of the four-colour problem
- Alpha-balanced graphs and matrices and GF(3)-representability of matroids
- Matroids and multicommodity flows
- Decomposition of group flows in regular matroids
- Separating cocircuits in binary matroids
- On minors of non-binary matroids
- A simple theorem on 3-connectivity
- An appraisal of computational complexity for operations researchers
- k-elimination property for circuits of matroids
- Triangles in 3-connected matroids
- Ternary paving matroids
- On minors avoiding elements in matroids
- On the computational behavior of a polynomial-time network flow algorithm
- Integer programs for logic constraint satisfaction
- Structural properties and decomposition of linear balanced matrices
- Short cycle covers and the cycle double cover conjecture
- Extensions of Tutte's wheels-and-whirls theorem
- A decomposition theory for matroids. VII: Analysis of minimal violation matrices
- A decomposition theory for matroids. VI: Almost regular matroids
- Some extremal connectivity results for matroids
- A characterization of certain excluded-minor classes of matroids
- Weak maps and stabilizers of classes of matroids
- Large circuits in binary matroids of large cogirth. II
- Linear programs for constraint satisfaction problems
- Intersections of circuits and cocircuits in binary matroids
- Triads and triangles in 3-connected matroids
- On matroids without a non-Fano minor
- On extremal connectivity properties of unavoidable matroids
- Maximal unimodular systems of vectors
- Matroids having the same connectivity function
- On rounded five-element lines of matroids
- Splitting formulas for Tutte polynomials
- Note on inseparability graphs of matroids having exactly one class of orientations
- A generalization of a graph result of D. W. Hall
- A longest cycle version of Tutte's wheels theorem
- On contractible and vertically contractible elements in 3-connected matroids and graphs
- Flows, view obstructions, and the lonely runner
- A splitter for graphs with no Petersen family minor
- On the minor-minimal 3-connected matroids having a fixed minor.
- The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor.
- Stabilizers of classes of representable matroids
- Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions
- Decomposition of balanced matrices
- On the structure of 3-connected matroids and graphs
- On binary matroids without a \(P_{10}\)-minor
- Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix
- Quasiregular matroids
- Staircase compatibility and its applications in scheduling and piecewise linearization
- A splitter theorem on 3-connected matroids
- Improving a chain theorem for triangle-free 3-connected matroids
- Non total-unimodularity neutralized simplicial complexes
- Classification of external zonotopal algebras
- Matroids with many small circuits and cocircuits
- Minimal \(k\)-connected non-Hamiltonian graphs
- On almost-planar graphs
- Discrete convexity and unimodularity. I.
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Towards a splitter theorem for internally 4-connected binary matroids. VI
- Pseudocodeword-free criterion for codes with cycle-free Tanner graph
- Biased graphs whose matroids are special binary matroids
- On an excluded-minor class of matroids
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- The Tutte polynomial of a ported matroid
This page was built for publication: Decomposition of regular matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144028)