Structural properties of matroid matchings

DOI10.1016/0166-218X(92)90115-QzbMath0774.05081OpenAlexW2066220173MaRDI QIDQ1199466

John H. Vande Vate

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90115-q

zbMATH Keywords

coverlinear matroid parity problemmatroid matchings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Solving the linear matroid parity problem as a sequence of matroid intersection problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
• A note on matchings and separability
• Short proofs on the matching polyhedron
• An extension of matching theory
• General factors of graphs
• An augmenting path algorithm for linear matroid parity
• Matching theory
• Matroid matching and some applications
• Solving the linear matroid parity problem as a sequence of matroid intersection problems
• Linear Systems for Constrained Matching Problems
• Perfect triangle-free 2-matchings
• Optimum matching forests I: Special weights
• Optimum matching forests II: General weights
• Optimum matching forests III: Facets of matching forest polyhedra
• Complexity of Matroid Property Algorithms
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Optimum branchings