New Bounds for the Snake-in-the-Box Problem

MaRDI QIDQ6271546zbMATH OpenFDO

Authors David B. Allison, Daniël Paulusma

Publication date 1 March 2016

Abstract: The Snake-in-the-Box problem is that of finding a longest induced path in an $n$-dimensional hypercube. We prove new lower bounds for the values $nin11,12,13$. The Coil-in-the-Box problem is that of finding a longest induced cycle in an $n$-dimensional hypercube. We prove new lower bounds for the values $nin12,13$.

This page was built for publication: New Bounds for the Snake-in-the-Box Problem

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