Graphs induced by Gray codes

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 585-598

  Wilmer, Elizabeth L ^a   Ernst, Michael D ^b  

^a OBERLIN COLLEGE   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Binary strings; Gray codes; Hamilton cycles; Hypercubes; Trees

Indexed keywords

EID: 33750977870     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00516-2     Document Type: Article

References (11)

1. B. Bultena, F. Ruskey, Transition restricted Gray codes, Electron. J. Combin. 3 (1996) #R11.
2. J.H. Conway, N.J.A. Sloane, A.R. Wilks, Gray codes for reflection groups, Graphs Combin. 5 (1989) 315-325.
3. E.N. Gilbert, Gray codes and paths on the n-cube, Bell System Tech. J. 37 (1958) 815-826.
4. L. Goddyn, G.M. Lawrence, E. Nemeth, Gray codes with optimized run lengths, Util. Math. 34 (1988) 179-192.
5. F. Gray, Pulse code communication, US Patent 2,632,058, 1958.
6. C. Savage, A survey of combinatorial Gray codes, SIAM Rev. 39 (1997) 605-629.
7. P.J. Slater, Open problem, in: Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Vol. II, Utilitas Mathematica Publishing, Winnipeg, 1979, pp. 918-919.
8. P.J. Slater, Research Problems 109 and 110, Discrete Math. 76 (1989) 293-294.
9. P.J. Slater, personal communication, 1989.
10. V.E. Vickers, J. Silverman, A technique for generating specialized Gray codes, IEEE Trans. Comput. C-29 (1980) 329-331.
11. E.L. Wilmer, Gray codings of trees, Undergraduate Thesis, Department of Mathematics, Harvard University, 1991.