scientific article; zbMATH DE number 53949
From MaRDI portal
Publication:4004142
zbMATH Open0760.05001MaRDI QIDQ4004142FDOQ4004142
Authors: Klaus Truemper 
Publication date: 18 September 1992
Full work available at URL: http://www.emis.de/monographs/md/
Title of this publication is not available (Why is that?)
Recommendations
regular matroidmatroid structurematroid decompositionSeymour's splitter theoremcomposition of matroidsexluded minor
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (88)
- Title not available (Why is that?)
- Testing the irreducibility of nonsquare Perron-Frobenius systems
- A base exchange property for regular matroids
- On internally 4-connected non-regular binary matroids
- Layered separators in minor-closed graph classes with applications
- Balanced cycles and holes in bipartite graphs
- Contractible bonds in graphs
- On rounded five-element lines of matroids
- On the representability of totally unimodular matrices on bidirected graphs
- On the sum of a parallelotope and a zonotope
- Strong splitter theorem
- Almost-graphic matroids
- Multimatroids. III: Tightness and fundamental graphs
- The excluded minors for the class of matroids that are binary or ternary
- Decomposition width of matroids
- Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices
- On matroids from self-orthogonal codes and their properties
- Forbidden minors for wye-delta-wye reducibility
- A decomposition theory for matroids. IV: Decomposition of graphs
- On the structure of 3-connected matroids and graphs
- A decomposition theory for matroids. I: General results
- On the notion of generalized minor in topological network theory and matroids
- Lifts of matroid representations over partial fields
- A decomposition theory for matroids. III. Decomposition conditions
- On topological spin models and generalized \(\Delta - Y\) transformations
- The Tutte polynomial of some matroids
- A decomposition theory for matroids. VI: Almost regular matroids
- On extension of graphic matroids
- Discovering all associations in discrete data using frequent minimally infrequent attribute sets
- Algebraic and dynamical cancellations associated to spectral sequence
- The thickness of a minor-excluded class of graphs
- The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor.
- Title not available (Why is that?)
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Normality of semigroups with some links to graph theory.
- Matroid 4-connectivity: A deletion-contraction theorem
- Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
- Recognizing Helly edge-path-tree graphs and their clique graphs
- Complexity results on restricted instances of a paint shop problem for words
- Extremality of submodular functions
- Approximating clique-width and branch-width
- Generalizing the all-pairs min cut problem
- Delta-wye reduction of almost-planar graphs
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Title not available (Why is that?)
- A polynomial time algorithm for solving the closest vector problem in zonotopal lattices
- The excluded minors for GF(4)-representable matroids
- Flexibility of projective-planar embeddings
- Title not available (Why is that?)
- Graphs whose positive semi-definite matrices have nullity at most two
- Good and nice colorings of balanced hypergraphs
- Bipartite graphs that are not circle graphs
- Rank-width and vertex-minors
- \(\Gamma\)-extension of binary matroids
- A longest cycle version of Tutte's wheels theorem
- The decomposition of the hypermetric cone into \(L\)-domains
- On total unimodularity of edge-edge adjacency matrices
- On testing consecutive-ones property in parallel
- Untangling planar curves
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tough spiders
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- A decomposition theory for matroids. II. Minimal violation matroids
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Transformation and decomposition of clutters into matroids
- The matroid intersection cover problem
- Rank connectivity and pivot-minors of graphs
- Obstacles to decomposition theorems for sixth-root-of-unity matroids
- Title not available (Why is that?)
- The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical
- Lower bounds for electrical reduction on surfaces
- Title not available (Why is that?)
- Regular matroid decomposition via signed graphs
- Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
- Title not available (Why is that?)
- On the number of circuits in regular matroids (with connections to lattices and codes)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs
- Covering Vectors by Spaces: Regular Matroids
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Binary signed-graphic matroids: representations and recognition algorithms
- Regular matroids have polynomial extension complexity
- Matroid connectivity and singularities of configuration hypersurfaces
- Signed-graphic matroids with all-graphic cocircuits
- Cosh gradient systems and tilting
- Digraphs of bounded width
- Nearly Gorenstein polytopes
- An algorithm for delta-wye reduction of almost-planar graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004142)
