Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)

DOI10.1016/S0195-6698(88)80026-XzbMATH Open0643.05048OpenAlexW2467886742MaRDI QIDQ1101468FDOQ1101468

Authors: Michel Mollard 

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80026-x

Recommendations

• A new method of generating Hamiltonian cycles on the n-cube
• On the spectrum of Hamiltonian cycles in the \(n\)-cube
• A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube
• scientific article; zbMATH DE number 1811355
• scientific article; zbMATH DE number 1185588
• scientific article; zbMATH DE number 1488848
• Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
• On the cycle spectrum of cubic Hamiltonian graphs
• scientific article; zbMATH DE number 1123890

zbMATH Keywords

Hamiltonian cyclesn-cube

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Bounds on the number of Hamiltonian circuits in the n-cube
• On the Number of Hamiltonian Circuits in the n-Cube
• Hamiltonian Circuits and Paths on the n-Cube

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
• Short dominating paths and cycles in the binary hypercube
• The snake-in-the-box problem: A new upper bound
• Title not available (Why is that?)
• On automorphisms of cycles in an \(n\)-dimensional Boolean cube

This page was built for publication: Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)

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