Matchings and -matroids
From MaRDI portal
Publication:920097
DOI10.1016/0166-218X(92)90272-CzbMATH Open0708.05014MaRDI QIDQ920097FDOQ920097
Authors: André Bouchet
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Delta-matroids for graph theorists
- Delta matroids whose fundamental graphs are bipartite
- Basis graphs of even delta-matroids
- Greedy algorithm and symmetric matroids
- scientific article; zbMATH DE number 3920480
- Circuit separation for symmetric matroids
- Matchings and \(\Delta\)-matroids with coefficients
- Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries
- scientific article; zbMATH DE number 1547724
greedy algorithmbipartite graphunioninductionmatchingssymmetric differenceDelta-matroidsmatroid base
Cites Work
- Matching theory
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The dependence graph for bases in matroids
- Greedy algorithm and symmetric matroids
- The perfectly matchable subgraph polytope of a bipartite graph
- Comments on bases in dependence structures
Cited In (33)
- The delta-sum of matching delta-matroids
- Nonintersecting paths, Pfaffians, and \(\Delta\)-matroids
- Maps and \(\Delta\)-matroids
- A 2-isomorphism theorem for delta-matroids
- Multimatroids. III: Tightness and fundamental graphs
- Filtered matchings and simplicial complexes
- Matching as the Intersection of Matroids
- \(b\)-matching degree-sequence polyhedra
- Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
- Basis graphs of even delta-matroids
- \(\Delta\)-matroids with the strong exchange conditions
- Parametric bisubmodular function minimization and its associated signed ring family
- \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
- On structures of bisubmodular polyhedra
- Symplectic matroids
- Parity systems and the delta-matroid intersection problem
- Optimal matching forests and valuated delta-matroids
- \(\Delta\)-matroid and jump system
- Pfaffian forms and \(\Delta\)-matroids with coefficients
- A unified treatment of the theories of matroids with coefficients and of \(\Delta\)-matroids with coefficients
- Two algorithms for valuated \(\Delta\)-matroids
- Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries
- Matchings on trees and the adjacency matrix: A determinantal viewpoint
- Signed permutohedra, delta‐matroids, and beyond
- On matroid parity and matching polytopes
- \(\Delta\)-matroids and metroids
- Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids
- $n!$ matchings, $n!$ posets
- Characterizing matroids whose bases form graphic delta-matroids
- Structural properties of matroid matchings
- Delta matroids whose fundamental graphs are bipartite
- Circuit separation for symmetric matroids
- Coverings and delta-coverings
This page was built for publication: Matchings and \(\Delta\)-matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920097)