𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new lower bound for Snake-in-the-Box Codes

✍ Scribed by J. Wojciechowski


Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
386 KB
Volume
9
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The snake-in-the-box problem: A new uppe
✍ Hunter S. Snevily πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 453 KB

We give a new upper bound for the length of the largest induced cycle in the hypercube. ## 1. Introduction Let G1 and Gz be two graphs. The Cartesian product G= G1 x G2 has V(G)= V(G,) x V(G,), and two vertices (ul, u2) and (vl, u2) of G are adjacent if and only if either ul=vl and uzuz~E(G2) or u