Bounds on the number of Hamiltonian circuits in the n-cube

DOI10.1016/0012-365X(77)90143-1zbMath0352.05042OpenAlexW1986508510MaRDI QIDQ1235718

Robert James Douglas

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90143-1

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube) ⋮ A survey of the theory of hypercube graphs ⋮ Matching graphs of Hypercubes and Complete Bipartite Graphs ⋮ On the complexity of testing a graph for n-cube ⋮ Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations ⋮ Gray codes for reflection groups

Cites Work

• On the Number of Hamiltonian Circuits in the n-Cube
• Error Detecting and Error Correcting Codes
• Hamiltonian Circuits and Paths on the n-Cube
• A Note on a Theorem of H. L. Abbott

This page was built for publication: Bounds on the number of Hamiltonian circuits in the n-cube