The snake-in-the-box problem: A new upper bound

DOI10.1016/0012-365X(94)90039-6zbMATH Open0812.05033MaRDI QIDQ1336714FDOQ1336714

Authors: Hunter Snevily 

Publication date: 3 November 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• An upper bound on the size of the snake-in-the-box
• scientific article; zbMATH DE number 1498820
• Publication:4888929
• A new non-asymptotic upper bound for snake-in-the-box codes
• Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)

zbMATH Keywords

hypercubelongest cycleupper boundsnake-in-the-box problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• A new lower bound for snake-in-the-box codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new upper bound for the length of snakes
• Further results on snakes in powers of complete graphs

Cited In (12)

• On constructing snakes in powers of complete graphs
• On the snake in the box problem
• Isomorphism of maximum length circuit codes
• Title not available (Why is that?)
• Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube
• Title not available (Why is that?)
• Snakes, coils, and single-track circuit codes with spread \(k\)
• A backward search algorithm for the snake in the box problem
• Title not available (Why is that?)
• An upper bound on the size of the snake-in-the-box
• A new upper bound for the length of snakes
• An algorithm for a problem of the largest induced cycles in \(Q^n\)

This page was built for publication: The snake-in-the-box problem: A new upper bound

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