The parity problem of polymatroids without double circuits
From MaRDI portal
Recommendations
- Matching Problems in Polymatroids Without Double Circuits
- On the generalization of the matroid parity problem
- THE CRITICAL PROBLEM FOR POLYMATROIDS
- On the graphic matroid parity problem
- Parity polytopes and binarization
- On matroid parity and matching polytopes
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- Parity systems and the delta-matroid intersection problem
- Parity, Eulerian subgraphs and the Tutte polynomial
- The linear delta-matroid parity problem
Cites work
- scientific article; zbMATH DE number 3703542 (Why is no real title available?)
- scientific article; zbMATH DE number 5691235 (Why is no real title available?)
- An orientation theorem with parity conditions
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of Matroid Property Algorithms
- Matroid matching and some applications
- On Generic Rigidity in the Plane
- On graphs and rigidity of plane skeletal structures
- On some combinatorial properties of algebraic matroids
- On the orientation of graphs
- On the orientation of graphs and hypergraphs
Cited in
(6)- Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski
- A Survey on Covering Supermodular Functions
- A note on parity constrained orientations
- Matching Problems in Polymatroids Without Double Circuits
- Parity systems and the delta-matroid intersection problem
- scientific article; zbMATH DE number 920721 (Why is no real title available?)
This page was built for publication: The parity problem of polymatroids without double circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987548)
