We prove that hamiltonian cycles of complete graphs can be generated in a Gray code manner by means of small local interchanges.

An N -dimensional digital binary image (I) is a function I : Z → {0, 1}. I is B3N−1,W3N−1 connected if and only if its black pixels and white pixels are each (3 − 1)-connected. I is only B3N−1 connected if and only if its black pixels are (3 − 1)-connected. For a 3-D binary image, the respective connectivity models are B26,W26 and B26. A pair of (3 N − 1)-neighboring opposite-valued pixels is c...