Multimatroids I. Coverings by Independent Sets
From MaRDI portal
Publication:4377446
DOI10.1137/S0895480193242591zbMath0886.05042OpenAlexW2033956728MaRDI QIDQ4377446
Publication date: 9 February 1998
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480193242591
Related Items (27)
A characterization of circle graphs in terms of total unimodularity ⋮ A compact representation for minimizers of \(k\)-submodular functions ⋮ The delta-sum of matching delta-matroids ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ Coverings and delta-coverings ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Recombination faults in gene assembly in ciliates modeled using multimatroids ⋮ Initial degenerations of spinor varieties ⋮ Signed permutohedra, delta‐matroids, and beyond ⋮ Isotropical linear spaces and valuated Delta-matroids ⋮ Matroids that classify forests ⋮ Parity in knot theory and graph-links ⋮ Binary matroids and local complementation ⋮ On the linear algebra of local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ Multimatroids. III: Tightness and fundamental graphs ⋮ The excluded 3-minors for vf-safe delta-matroids ⋮ Isotropic matroids. I: Multimatroids and neighborhoods ⋮ Isotropic matroids. II: Circle graphs ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ A characterization of circle graphs in terms of multimatroid representations ⋮ Half-integrality, LP-branching, and FPT Algorithms ⋮ Symplectic matroids ⋮ Multimatroids. IV: Chain-group representations ⋮ Inductive tools for connected delta-matroids and multimatroids
This page was built for publication: Multimatroids I. Coverings by Independent Sets
