The parity problem of polymatroids without double circuits
From MaRDI portal
Publication:987548
DOI10.1007/S00493-008-2374-1zbMATH Open1212.05032OpenAlexW2074213938MaRDI QIDQ987548FDOQ987548
Authors: Márton Makai, Jácint Szabó 
Publication date: 13 August 2010
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-008-2374-1
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
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On graphs and rigidity of plane skeletal structures
- On Generic Rigidity in the Plane
- Matroid matching and some applications
- Complexity of Matroid Property Algorithms
- On the orientation of graphs
- On the orientation of graphs and hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On some combinatorial properties of algebraic matroids
- An orientation theorem with parity conditions
Cited In (6)
- Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski
- A note on parity constrained orientations
- Matching Problems in Polymatroids Without Double Circuits
- Title not available (Why is that?)
- Parity systems and the delta-matroid intersection problem
- A Survey on Covering Supermodular Functions
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)
