scientific article

Publication date: 18 September 1992

Full work available at URL: http://www.emis.de/monographs/md/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

regular matroid matroid structure matroid decomposition Seymour's splitter theorem composition of matroids exluded minor

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Forbidden minors for wye-delta-wye reducibility, Regular matroid decomposition via signed graphs, A tight relation between series-parallel graphs and bipartite distance hereditary graphs, Unnamed Item, Unnamed Item, On rounded five-element lines of matroids, Covering Vectors by Spaces: Regular Matroids, Flexibility of projective-planar embeddings, Generalizing the all-pairs min cut problem, Regular Matroids Have Polynomial Extension Complexity, A longest cycle version of Tutte's wheels theorem, On internally 4-connected non-regular binary matroids, Signed-graphic matroids with all-graphic cocircuits, The matroid intersection cover problem, The thickness of a minor-excluded class of graphs, Layered separators in minor-closed graph classes with applications, On total unimodularity of edge-edge adjacency matrices, Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs, Algebraic and dynamical cancellations associated to spectral sequence, Binary signed-graphic matroids: representations and recognition algorithms, Testing the irreducibility of nonsquare Perron-Frobenius systems, A base exchange property for regular matroids, Strong splitter theorem, On the sum of a parallelotope and a zonotope, Untangling planar curves, Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms, Cosh gradient systems and tilting, \(\Gamma\)-extension of binary matroids, Nearly Gorenstein polytopes, Decomposition width of matroids, An algorithm for delta-wye reduction of almost-planar graphs, On matroids from self-orthogonal codes and their properties, Good and nice colorings of balanced hypergraphs, Graphs whose positive semi-definite matrices have nullity at most two, The Tutte polynomial of some matroids, Discovering all associations in discrete data using frequent minimally infrequent attribute sets, The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor., Matroid connectivity and singularities of configuration hypersurfaces, On topological spin models and generalized \(\Delta - Y\) transformations, Delta-wye reduction of almost-planar graphs, Extremality of submodular functions, A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices, On the notion of generalized minor in topological network theory and matroids, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical, Almost-graphic matroids, Unnamed Item, Lifts of matroid representations over partial fields, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Contractible bonds in graphs, Complexity results on restricted instances of a paint shop problem for words, Multimatroids. III: Tightness and fundamental graphs, Tough spiders, Approximating clique-width and branch-width, The excluded minors for the class of matroids that are binary or ternary, Recognizing Helly edge-path-tree graphs and their clique graphs, A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid, On extension of graphic matroids, Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices, Lower bounds for electrical reduction on surfaces, The decomposition of the hypermetric cone into \(L\)-domains, Unnamed Item, On testing consecutive-ones property in parallel, Rank-width and vertex-minors, On the representability of totally unimodular matrices on bidirected graphs, On the structure of 3-connected matroids and graphs, Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices, Bipartite graphs that are not circle graphs, Balanced cycles and holes in bipartite graphs, Digraphs of Bounded Width, On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes), Normality of semigroups with some links to graph theory., The excluded minors for GF(4)-representable matroids, Balanced \(0,\pm 1\) matrices. I: Decomposition, Matroid 4-connectivity: A deletion-contraction theorem, Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces, Rank connectivity and pivot-minors of graphs