On the Number of Hamiltonian Circuits in the n-Cube

DOI10.2307/2040592zbMath0317.05112OpenAlexW4239192648MaRDI QIDQ4078064

No author found.

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)

Related Items

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, Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations, Bounds on the number of Hamiltonian circuits in the n-cube, Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs, Gray codes for reflection groups