[1] BIGGS N.: Some odd graph theory. In: Second International Conference on Combinatorial Mathematics (New York, 1978). Ann. New York Acad. Sci. 319, New York Acad. Sci., New York, 1979, pp. 71-81. MR 0556008

[2] BITNER J. R., EHRLICH G., REINGOLD E. M.: Efficient generation of the binary reflected Gray code and its applications. Comm. ACM 19 (1976), 517-521. MR 0424386 | Zbl 0333.94006

[3] BUCK M., WIEDEMANN D.: Gray codes with restricted density. Discrete Math. 48 (1984), 163-171. MR 0737262 | Zbl 0572.05042

[4] CHASE P. J.: Algorithm 382 combinations of m out of n objects. Comm. ACM 13 (1970), 368, 376.

[5] CHASE P. J.: Transposition graphs. SIAM J. Comput. 2 (1973), 128-133. MR 0342438 | Zbl 0264.05120

[6] EHRLICH G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. Assoc. Comput. Mach. 20 (1973), 500-513. MR 0366085 | Zbl 0266.68018

[7] GILBERT E. N.: Gray codes and paths on the n-cube. Bell System Tech. J. 37 (1958), 815-826. MR 0094273

[8] GRANT D. D., HOLTON D. A.: Stable and semi-stable unicyclic graphs. Discrete Math. 9 (1974), 277-288. MR 0345876 | Zbl 0286.05114

[9] GRAY F.: Pulse code communications. U. S. Patent 2632 058, March 17, 1953.

[10] HU T. C, RUSKEY F.: Generating binary trees lexicographically. SIAM J. Comput. 6 (1977), 745-758. MR 0478737 | Zbl 0366.68027

[11] JOHNSON S. M.: Generation of permutations by adjacent transposition. Math. Comp. 17 (1963), 282-285. MR 0159764 | Zbl 0114.01203

[12] JOICHI S. T., WHITE D. E.: Gray codes in graphs of subsets. Discrete Math. 31 (1980), 29-41. MR 0578058 | Zbl 0449.05043

[13] JOICHI S. T., WHITE D. E., WILLIAMSON S. G.: Combinatorial Gray codes. SIAM J. Comput. 9 (1980), 130-141. MR 0557834 | Zbl 0452.05009

[14] MEREDITH G. H. J., LLOYD E. K.: The Hamiltonian graphs $O_4$ to $O_7$. Combinatorica (1972), 229-236. MR 0457282

[15] PROSKUROWSKI A., RUSKEY F.: Binary tree Gray codes. J. Algorithms 6 (1985), 225-238. MR 0789905 | Zbl 0593.68050

[16] PROSKUROWSKI A., RUSKEY F.: Generating binary trees by transpositions. In: SWAT 88. Lecture Notes in Comput. Sci. 318, Springer, New York-Berlin, 1988, pp. 199-207. MR 1019370 | Zbl 0651.68081

[17] RUSKEY F.: Adjacent interchange generation of combinations. J. Algorithms 9 (1988), 162-180. MR 0936104 | Zbl 0726.05003

[18] SAVAGE C. D.: Gray code sequences of partitions. J. Algorithms 10 (1989), 557-595. MR 1022113 | Zbl 0693.05006

[19] TCHUENTE M.: Generation of permutations by graphical exchanges. Ars Combin. 14 (1982), 115-122. MR 0683982 | Zbl 0508.05041