Table of n, a(n) for n=1..7.
M. K. Chari and M. Joswig, Complexes of discrete Morse functions, Disc. Math. 302 (2005), 3951.
D. Deford, Seating rearrangements on arbitrary graphs, 2013; See Table 3.
N. Graham and F. Harary, The number of perfect matchings in a hypercube, Appl. Math. Lett., 1 (1988), 4548.
N. Graham & F. Harary, The number of perfect matchings in a hypercube, Appl. Math. Lett. 1.1 (1988), 4548. (Annotated scanned copy)
Per Hakan Lundow, Computation of matching polynomials and the number of 1factors in polygraphs, Research report, No 12, 1996, Department of Math., Umea University, Sweden.
P. R. J. Ostergard and V. H. Pettersson, Enumerating Perfect Matchings in nCubes, Order, November 2013, Volume 30, Issue 3, pp 821835.
Ville Pettersson, Graph Algorithms for Constructing and Enumerating Cycles and Related Structures, Preprint 2015.
J. Propp, Twenty open problems in enumeration of matchings, arXiv:math/9801061 [math.CO], 19981999.
J. Propp, Updated article
J. Propp, Enumeration of matchings: problems and progress, in L. J. Billera et al. (eds.), New Perspectives in Algebraic Combinatorics
H. Sachs, B. Alspach, Problem 298: How many perfect matchings does the graph of the ncube have?, Discrete Math., 191 (1998), 251252. [From N. J. A. Sloane, Feb 18 2012]
Eric Weisstein's World of Mathematics, Hypercube Graph
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Maximum Independent Edge Set
Eric Weisstein's World of Mathematics, Minimum Clique Covering
Eric Weisstein's World of Mathematics, Minimum Edge Cover
Eric Weisstein's World of Mathematics, Perfect Matching
