Enumerating perfect matchings in \(n\)-cubes
type: Item
instance of: scholarly article
title: Enumerating perfect matchings in \(n\)-cubes
zbMATH Open document ID: 1276.05095
author: Patric R. J. Östergård
author: Ville H. Pettersson
published in: Order
publication date: 2013-11-22T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6232026
zbMATH Keywords: perfect matching
zbMATH Keywords: N-cube
zbMATH Keywords: dynamic programming
zbMATH Keywords: enumeration
describes a project that uses: libexact
MaRDI profile type: Publication
full work available at URL: s11083-012-9279-8
OpenAlex ID: W2012125988
Wikidata QID: Q60692021
cites work: Q4390664
cites work: There are 526,915,620 nonisomorphic one‐factorizations of K12
cites work: Finding all the perfect matchings in bipartite graphs
cites work: Q3137758
cites work: The number of perfect matchings in a hypercube
cites work: Counting Hamiltonian cycles in bipartite graphs
cites work: The number of Latin squares of order 11
cites work: There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
cites work: Matching theory
cites work: On the number of Latin squares
cites work: Classification of Binary Constant Weight Codes
cites work: Q4938474
cites work: Q4370201
cites work: Q4474103
cites work: The complexity of computing the permanent
DOI: 10.1007/S11083-012-9279-8
description: scientific article; zbMATH DE number 6232026