Chip removal for computing the number of perfect matchings

DOI10.1007/s10958-016-2886-yzbMath1341.05201OpenAlexW2404212820MaRDI QIDQ2628953

O. V. Bursian

Publication date: 19 July 2016

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-016-2886-y

zbMATH Keywords

plane bipartite graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Applications of graphical condensation for enumerating matchings and tilings
• Chip removal. Urban renewal revisited
• Graphical condensation, overlapping Pfaffians and superpositions of matchings
• Domino tilings of Aztec diamonds and squares
• An exploration of the permanent-determinant method
• Generalized domino-shuffling.

This page was built for publication: Chip removal for computing the number of perfect matchings