On the Number of Hamiltonian Circuits in the n-Cube

DOI10.2307/2040592MaRDI QIDQ4078064zbMATH OpenOpenAlexFDO

Authors

Publication date 1975

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2040592

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cited in

(6)

• Gray codes for reflection groups
• Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
• Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
• Bounds on the number of Hamiltonian circuits in the n-cube
• A survey of the theory of hypercube graphs
• Enumeration of labeled and unlabeled Hamiltonian cycles in complete k-partite graphs

This page was built for publication: On the Number of Hamiltonian Circuits in the n-Cube

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