Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
From MaRDI portal
Publication:976091
DOI10.1016/J.IPL.2008.10.015zbMATH Open1191.68123OpenAlexW2009191940MaRDI QIDQ976091FDOQ976091
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
Recommendations
Cites Work
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Title not available (Why is that?)
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Perfect matchings extend to Hamilton cycles in hypercubes
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stable networks and product graphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- On the Number of Hamiltonian Circuits in the n-Cube
Cited In (3)
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)
