Enumerating perfect matchings in \(n\)-cubes

DOI10.1007/s11083-012-9279-8zbMath1276.05095OpenAlexW2012125988WikidataQ60692021 ScholiaQ60692021MaRDI QIDQ382880

Patric R. J. Östergård, Ville H. Pettersson

Publication date: 22 November 2013

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-012-9279-8

zbMATH Keywords

dynamic programmingenumerationperfect matchingN-cube

Mathematics Subject Classification ID

Dynamic programming (90C39) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Characteristic polynomials, spectral-based Riemann-zeta functions and entropy indices of \(n\)-dimensional hypercubes ⋮ Exact Ramsey numbers of odd cycles via nonlinear optimisation ⋮ Enumerating Hamiltonian cycles

Uses Software

• libexact

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of perfect matchings in a hypercube
• The complexity of computing the permanent
• Matching theory
• Finding all the perfect matchings in bipartite graphs
• On the number of Latin squares
• Counting Hamiltonian cycles in bipartite graphs
• The number of Latin squares of order 11
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• Classification of Binary Constant Weight Codes