Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
type: Item
instance of: scholarly article
title: Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
zbMATH Open document ID: 0643.05048
DOI: 10.1016/S0195-6698(88)80026-X
author: Michel Mollard
published in: European Journal of Combinatorics
publication date: 1988-01-01T00:00:00Z
review text: Let \(Q_ n\) be the n-cube, that is the graph where the nodes are words of length n on the alphabet \(\{\) 0,1\(\}\) and two vertices are linked by an edge if they differ in exactly one coordinate. Let h(n) be the number of Hamiltonian cycles of \(Q_ n\). For \(n\geq 5\) only bounds on h(n) are known. The author gives new upper and lower bounds for h(n).
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 4047770
zbMATH Keywords: n-cube
zbMATH Keywords: Hamiltonian cycles
MaRDI profile type: Publication
cites work: On the Number of Hamiltonian Circuits in the n-Cube
cites work: Bounds on the number of Hamiltonian circuits in the n-cube
cites work: Hamiltonian Circuits and Paths on the n-Cube
full work available at URL: s0195-6698(88)80026-x
OpenAlex ID: W2467886742
Recommended article: A new method of generating Hamiltonian cycles on the n-cube
Recommended article: On the spectrum of Hamiltonian cycles in the \(n\)-cube
Recommended article: A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
Recommended article: Q3148514
Recommended article: Q3838393
Recommended article: Q4495680
Recommended article: Hamiltonian Cycles through Prescribed Edges in k-Ary n-Cubes
Recommended article: On the cycle spectrum of cubic Hamiltonian graphs
Recommended article: Q4378246
description: scientific article; zbMATH DE number 4047770