Bent Hamilton cycles in d-dimensional grid graphs

Electronic Journal of Combinatorics

Volumn 10, Issue 1 R, 2003, Pages

  Ruskey, F ^a   Sawada, Joe ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042576002     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1694     Document Type: Article

References (6)

1. B. Bultena and F. Ruskey, Transition Restricted Gray Codes, Electronic Journal of Combinatorics, 3 (1996), paper R11, 11pp.
2. L. Goddyn, L. and P. Gvozdjak, Binary Gray Codes with Long Bit Runs, Electronic Journal of Combinatorics, to appear.
3. A. Itai, C.H. Papadimitriou, and J. Szwarcfiter, Hamilton Paths in Grid Graphs, SIAM Journal on Computing, 11 (1982) 676-686.
4. A. Proskurowski, F. Ruskey, and M. Smith, Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings Induced by Simple Group Actions, SIAM Journal on Discrete Mathematics, 11 (1998) 94-109.
5. C.D. Savage, A survey of combinatorial Gray codes, SIAM Review 39 (1997) 605-629.
6. W.T. Trotter and P. Erdös, When the Cartesian product of directed cycles is Hamiltonian, Journal of Graph Theory, 2 (1978) 137-142.