Snakes, coils, and single-track circuit codes with spread k

@article{Hood2015SnakesCA,
  title={Snakes, coils, and single-track circuit codes with spread k},
  author={Simon Hood and Daniel Recoskie and Joe Sawada and Dennis Wong},
  journal={J. Comb. Optim.},
  year={2015},
  volume={30},
  pages={42-62}
}
The snake-in-the-box problem is concerned with finding a longest induced path in a hypercube Qn. Similarly, the coil-in-the-box problem is concerned with finding a longest induced cycle in Qn. We consider a generalization of these problems that considers paths and cycles where each pair of vertices at distance at least k in the path or cycle are also at distance at least k in Qn. We call these paths k-snakes and the cycles k-coils. The k-coils have also been called circuit codes. By optimizing… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 50 references

Snake-in-the-box codes for dimension 7

  • K. J. Kochut
  • Journal of Combinatorial Mathematics and…
  • 1996
Highly Influential
4 Excerpts

Latest records for the snake-in-the-box problem

  • W. Potter
  • In http://www.ai.uga.edu/sib/records/,
  • 2012
1 Excerpt

Similar Papers

Loading similar papers…