Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference12 articles.
1. H. L. Abbot: Some Problems in Combinatorial Analysis, PhD thesis, University of Alberta, Edmonton, Canada, 1965.
2. H. L. Abbot andM. Katchalski: On the construction of snake in the box codes,Utilitas Mathematica,40 (1991), 97?116.
3. L. Danzer andV. Klee: Length of snakes in boxes,J. Combin. Theory,2 (1967), 258?265.
4. K. Deimer: A new upper bound for the length of snakes,Combinatorica,5 (1985), 109?120.
5. R. J. Douglas: Upper bounds on the length of circuits of even spread in thed-cube,J. Combin. Theory,7 (1969), 206?214.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献