1. I. J. Dejter (1985) Hamiltonian cycles and quotients of bipartite graphs, in Graph Theory and Applications to Algorithms and Computer Science (eds. Y. Alavi et al.) John Wiley, New York, pp. 189?199.
2. I. J. Dejter, Hamiltonian cycles in bipartite reflective Kneser graphs, preprint.
3. D. Duffus, P. Hanlon, and R. Roth, Matchings and Hamiltonian cycles in some families of symmetric graphs, Nokahoma Math. J., to appear.
4. D. Duffus, B. Sands, and R. Woodrow (1988) Lexicographical matchings cannot form Hamiltonian cycles, Order 5, 149?161.
5. W. Feller, An Introduction to Probability and Its Applications 1, 3rd edn.