1. On the factorization of the complete uniform hypergraph;Baranyai;Colloq. Math. Soc. Janos Bolyai,1975
2. Hamiltonian uniform subset graphs;Chen;J. Combin. Theory Ser. B,1987
3. Kneser graphs are Hamiltonian for n⩾ 3k;Chen;J. Combin. Theory Ser. B,2000
4. Binomial and Q-binomial coefficient inequalities related to the hamiltonicity of the Kneser graphs and their q-analogues;Clark;J. Combin. Theory Ser. A,1996
5. I.J. Dejter, Hamilton cycles and quotients of bipartite graphs, Graph Theory with Applications to Algorithms and Computer Science, Wiley–Interscience, New York, 1985, pp. 189–199.