Decomposition of regular matroids
From MaRDI portal
Publication:1144028
DOI10.1016/0095-8956(80)90075-1zbMath0443.05027WikidataQ56209792 ScholiaQ56209792MaRDI QIDQ1144028
Publication date: 1980
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(80)90075-1
binary matroids; sums; regular matroid; circuit matroid; cocircuit matroid; linear independence matroid
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
On sign-representable matroids, Some Local Extremal Connectivity Results for Matroids, Non-Binary Matroids Having At Most Three Non-Binary Elements, On the computational complexity of the Jones and Tutte polynomials, A Characterization of Almost-Planar Graphs, Polyhedral techniques in combinatorial optimization I: Theory, Unnamed Item, Some Small Circuit-Cocircuit Ramsey Numbers for Matroids, On Matroids Representable over 𝐺𝐹(3) and Other Fields, Tutte polynomials computable in polynomial time, Planar graphs with no 6-wheel minor, The anti-join composition and polyhedra, Large circuits in binary matroids of large cogirth. I, \(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, 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, 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, Biased graphs whose matroids are special binary matroids, On an excluded-minor class of matroids, \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts, Compositions for matroids with the Fulkerson property, Decomposition of wheel-and-parachute-free balanced bipartite graphs, Base exchange properties of graphic matroids, Inequivalent representations of ternary matroids, Hilbert bases of cuts, Binary matroids without prisms, prism duals, and cubes, Decomposition of 3-connected graphs, Binary Supersolvable Matroids and Modular Constructions
