Special parity of perfect matchings in bipartite graphs

DOI10.1016/0012-365X(90)90330-KMaRDI QIDQ1812865zbMATH OpenFDO

Authors Rachel Manber, Ron Aharoni, Bronisław Wajnryb

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(90)90330-K

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)

Recommendations

• Perfect matchings of regular bipartite graphs
• A note on the number of perfect matchings of bipartite graphs
• On the uniqueness of perfect matchings in bipartite graphs
• Cutsets in bipartite graphs^*

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Cyclic and diagonal products on a matrix
• Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices
• Graph-theoretical approach to qualitative solvability of linear systems
• scientific article; zbMATH DE number 3781005 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• Qualitative Economics and the Scope of the Correspondence Principle
• Signsolvability revisited

Cited in

(6)

• Group weighted matchings in bipartite graphs
• On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings
• Cutsets in bipartite graphs^*
• Fair representation by independent sets
• Perfect matchings of regular bipartite graphs
• Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem

This page was built for publication: Special parity of perfect matchings in bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812865)