Matchings and \(\Delta\)-matroids
From MaRDI portal
Publication:920097
DOI10.1016/0166-218X(92)90272-CzbMath0708.05014MaRDI QIDQ920097
Publication date: 1989
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
bipartite graphgreedy algorithmmatchingsinductionunionsymmetric differenceDelta-matroidsmatroid base
Related Items
Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries, Pfaffian forms and \(\Delta\)-matroids with coefficients, Basis graphs of even delta-matroids, Two algorithms for valuated \(\Delta\)-matroids, The delta-sum of matching delta-matroids, Nonintersecting paths, Pfaffians, and \(\Delta\)-matroids, Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs, Coverings and delta-coverings, Signed permutohedra, delta‐matroids, and beyond, \(b\)-matching degree-sequence polyhedra, Delta matroids whose fundamental graphs are bipartite, Optimal Matching Forests and Valuated Delta-Matroids, Multimatroids. III: Tightness and fundamental graphs, On structures of bisubmodular polyhedra, Symplectic matroids, Characterizing matroids whose bases form graphic delta-matroids, \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids, \(\Delta\)-matroids with the strong exchange conditions, Parametric bisubmodular function minimization and its associated signed ring family
Cites Work
