×

zbMATH — the first resource for mathematics

Generating hamiltionian cycles in complete graphs. (English) Zbl 0821.05036
Summary: We prove that hamiltonian cycles of complete graphs can be generated in a Gray code manner by means of small local interchanges.

MSC:
05C45 Eulerian and Hamiltonian graphs
PDF BibTeX XML Cite
Full Text: EMIS EuDML