Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations

DOI10.1016/j.ipl.2008.10.015zbMath1191.68123OpenAlexW2009191940MaRDI QIDQ976091

Tomás Feder, Carlos Subi

Publication date: 16 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.10.015

zbMATH Keywords

hypercubematchingsCartesian productsHamiltonian circuitscounting problems

Mathematics Subject Classification ID

Computer system organization (68M99)

Related Items (2)

On locally balanced gray codes ⋮ Matching graphs of hypercubes and complete bipartite graphs

Cites Work

• Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Bounds on the number of Hamiltonian circuits in the n-cube
• Perfect matchings extend to Hamilton cycles in hypercubes
• The statistics of dimers on a lattice
• On the Number of Hamiltonian Circuits in the n-Cube
• Stable networks and product graphs
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations