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

DOI10.1016/J.IPL.2008.10.015MaRDI QIDQ976091zbMATH OpenOpenAlexFDO

Authors 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

hypercubematchingscounting problemsCartesian productsHamiltonian circuits

Mathematics Subject Classification ID

Computer system organization (68M99)

Recommendations

• scientific article; zbMATH DE number 1811355
• scientific article; zbMATH DE number 888853
• scientific article; zbMATH DE number 790411
• Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
• Perfect matchings extend to two or more Hamiltonian cycles in hypercubes

Cites work

• scientific article; zbMATH DE number 5941300 (Why is no real title available?)
• scientific article; zbMATH DE number 1811355 (Why is no real title available?)
• scientific article; zbMATH DE number 3458807 (Why is no real title available?)
• scientific article; zbMATH DE number 1156633 (Why is no real title available?)
• scientific article; zbMATH DE number 888853 (Why is no real title available?)
• Bounds on the number of Hamiltonian circuits in the n-cube
• On the Number of Hamiltonian Circuits in the n-Cube
• Perfect matchings extend to Hamilton cycles in hypercubes
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• Stable networks and product graphs
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

Cited in

(3)

• scientific article; zbMATH DE number 1811355 (Why is no real title available?)
• Matching graphs of hypercubes and complete bipartite graphs
• On locally balanced Gray codes

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

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