The Hypercube Graph Qn: Matchings and Hamiltonicity

The hypercube Qn connects n-bit strings (or subsets of an n-set) that differ in one bit; it is n-regular and bipartite, and for n >= 1 always has a perfect matching and a Hamiltonian cycle (n >= 2).