A note on the number of perfect matchings of bipartite graphs

DOI10.1016/S0166-218X(96)00107-2zbMath0870.05068OpenAlexW113425656MaRDI QIDQ678856

Heping Zhang, Fu Ji Zhang

Publication date: 15 September 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

adjacency matrixfast algorithmperfect matchingsplane bipartite graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians ⋮ Single coronoid systems with an anti-forcing edge ⋮ Cell rotation graphs of strongly connected orientations of plane graphs with an application ⋮ \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs ⋮ Construction for bicritical graphs and \(k\)-extendable bipartite graphs ⋮ Enumeration of perfect matchings of a type of Cartesian products of graphs

Cites Work

• Matching theory
• Plane elementary bipartite graphs
• The correspondence between the resonance and molecular orbital theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the number of perfect matchings of bipartite graphs