Coverings and delta-coverings
From MaRDI portal
Publication:5101418
DOI10.1007/3-540-59408-6_54zbMath1498.90182OpenAlexW1602190525MaRDI QIDQ5101418
Publication date: 30 August 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59408-6_54
Related Items (7)
The adjacency matroid of a graph ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ The linear delta-matroid parity problem ⋮ Multimatroids. III: Tightness and fundamental graphs ⋮ Half-integrality, LP-branching, and FPT Algorithms ⋮ Matroids, delta-matroids and embedded graphs ⋮ Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matchings and \(\Delta\)-matroids
- Some combinatorial properties of discriminants in metric vector spaces
- Unimodularity and circle graphs
- Pseudomatroids
- Directed submodularity, ditroids and directed submodular flows
- Matroid matching and some applications
- \(\Delta\)-matroids and metroids
- Bimatroids and invariants
- A characterisation of graphs having three pariwise compatible Euler tours
- Supplementary Eulerian vectors in isotropic systems
- Compatible Euler tours and supplementary Eulerian vectors
- The delta-sum of matching delta-matroids
- On totally dual integral systems
- Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus
- Maps and \(\Delta\)-matroids
- Greedy algorithm and symmetric matroids
- A greedy algorithm for solving a certain class of linear programmes
- Multimatroids I. Coverings by Independent Sets
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Paths, Trees, and Flowers
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Comments on bases in dependence structures
- Lehmans switching game and a theorem of Tutte and Nash-Williams
This page was built for publication: Coverings and delta-coverings
