Coverings and delta-coverings
From MaRDI portal
Publication:5101418
Recommendations
Cites work
- \(\Delta\)-matroids and metroids
- A characterisation of graphs having three pariwise compatible Euler tours
- A greedy algorithm for solving a certain class of linear programmes
- Bimatroids and invariants
- Comments on bases in dependence structures
- Compatible Euler tours and supplementary Eulerian vectors
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Directed submodularity, ditroids and directed submodular flows
- Greedy algorithm and symmetric matroids
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 3970769 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3340103 (Why is no real title available?)
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- Maps and -matroids
- Matchings and \(\Delta\)-matroids
- Matroid matching and some applications
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Multimatroids I. Coverings by Independent Sets
- On totally dual integral systems
- Orthogonal A-trails of 4-regular graphs embedded in surfaces of low genus
- Paths, Trees, and Flowers
- Pseudomatroids
- Some combinatorial properties of discriminants in metric vector spaces
- Supplementary Eulerian vectors in isotropic systems
- The delta-sum of matching delta-matroids
- Unimodularity and circle graphs
Cited in
(13)- The linear delta-matroid parity problem
- Parity systems and the delta-matroid intersection problem
- Matroids, delta-matroids and embedded graphs
- Half-integrality, LP-branching, and FPT algorithms
- Matching problems with delta-matroid constraints
- The adjacency matroid of a graph
- Interlace polynomials for multimatroids and delta-matroids
- Multimatroids I. Coverings by Independent Sets
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Multimatroids. III: Tightness and fundamental graphs
- Parallel discrete sampling via continuous walks
- A primer on delta-matroids and multimatroids
- Faster algorithms on linear delta-matroids
This page was built for publication: Coverings and delta-coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101418)