Multimatroids. IV: Chain-group representations
From MaRDI portal
Publication:1307539
DOI10.1016/S0024-3795(97)10041-6zbMath0932.05019MaRDI QIDQ1307539
Publication date: 13 March 2000
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items (6)
A characterization of circle graphs in terms of total unimodularity ⋮ On the linear algebra of local complementation ⋮ Isotropic matroids. I: Multimatroids and neighborhoods ⋮ Isotropic matroids. II: Circle graphs ⋮ A characterization of circle graphs in terms of multimatroid representations ⋮ Half-integrality, LP-branching, and FPT Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Some combinatorial properties of discriminants in metric vector spaces
- Isotropic systems
- Unimodularity and circle graphs
- Pseudomatroids
- Graphic presentations of isotropic systems
- Symplectic matroids
- Multimatroids. II: Orthogonality, minors and connectivity
- Greedy algorithm and symmetric matroids
- Combinatorial geometries and torus strata on homogeneous compact manifolds
- Multimatroids I. Coverings by Independent Sets
- Lectures on matroids
- Multimatroids. III: Tightness and fundamental graphs
This page was built for publication: Multimatroids. IV: Chain-group representations
