A new method of generating Hamiltonian cycles on the n-cube

DOI10.1016/0012-365X(90)90390-4MaRDI QIDQ804595zbMATH OpenOpenAlexWikidataFDO

Authors Mark Ramras

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90390-4

zbMATH Keywords

Hamilton cyclesn-cube

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Review text

A simple method is given for iteratively producing Hamilton cycles on the n-cube such that no subpath traverses a proper subcube of more than 2 vertices.

Cites work

• Some Complete Cycles on the n-Cube

Cited in

(4)

• On the \((n,t)\)-antipodal Gray codes
• Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
• Antipodal Gray codes
• Matchings in hypercubes extend to long cycles

This page was built for publication: A new method of generating Hamiltonian cycles on the n-cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804595)