Lexicographic matchings cannot form Hamiltonian cycles

M. Aigner (1973) Lexicographic matching in Boolean algebras, J. Comb. Theory Series B, 14, 187?194.

I. J. Dejter, Hamiltonian cycles in bipartite Kneser graphs, preprint.

D. Duffus, P. Hanlon, and R. Roth, Matchings and Hamiltonian cycles in some families of symmetric graphs, Nokahoma Math. J., to appear.

H. A. Kierstead and W. T. Trotter (1988) Explicit matchings in the middle levels of the Boolean lattice, Order 5, 163?171.