Special parity of perfect matchings in bipartite graphs

DOI10.1016/0012-365X(90)90330-KzbMath0744.05036MaRDI QIDQ1812865

Rachel Manber, Bronisław Wajnryb, Ron Aharoni

Publication date: 25 June 1992

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

zbMATH Keywords

bipartite graphperfect matchingreal matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items

Cutsets in bipartite graphs^*, Fair Representation by Independent Sets, Group weighted matchings in bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Signsolvability revisited
• Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
• Graph-theoretical approach to qualitative solvability of linear systems
• Cyclic and diagonal products on a matrix
• Qualitative Economics and the Scope of the Correspondence Principle
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs