The parity problem of polymatroids without double circuits

DOI10.1007/s00493-008-2374-1zbMath1212.05032OpenAlexW2074213938MaRDI QIDQ987548

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

zbMATH Keywords

maximum matchingpolymatroidsmatroid parity problemdouble circuits

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A Survey on Covering Supermodular Functions ⋮ A note on parity constrained orientations

Cites Work

• Unnamed Item
• Unnamed Item
• On some combinatorial properties of algebraic matroids
• On the orientation of graphs
• Matroid matching and some applications
• On the orientation of graphs and hypergraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On graphs and rigidity of plane skeletal structures
• Complexity of Matroid Property Algorithms
• On Generic Rigidity in the Plane
• An orientation theorem with parity conditions