A new upper bound for the length of snakes-Reference-Cited by-同舟云学术

A new upper bound for the length of snakes

Published:1985-06 Issue:2 Volume:5 Page:109-120
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Deimer Knut

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02579373.pdf

Reference8 articles.

1. H. L. Abbott, A Note on the Snake-in-the-Box Problem, unpublished manuscript.Some Problems in Combinatorial Analysis, Ph. D. thesis, University of Alberta, Edmonton, Canada, 1965.

2. L. Danzer andV. Klee, Length of Snakes in Boxes,J. Combinatorial Theory 2 (1967), 258–265.

3. R. J. Douglas, Upper Bounds on the Length of Circuits of Even Spread in thed-Cube,J. Combinatorial Theory 7 (1969), 206–214.

4. V. V. Glagolev, An Upper Estimate of the Length of a Cycle in then-Dimensional Unit Cube (Russian),Diskretnyi Analiz 6 (1966), 3–7.

5. W. H. Kautz, Unit-Distance Error-Checking Codes,IRE Trans. Electronic Computers 3 (1958), 179–180.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Snakes, coils, and single-track circuit codes with spread $$k$$ k;Journal of Combinatorial Optimization;2013-05-29

2. k-pseudosnakes in Large Grids;LATIN 2002: Theoretical Informatics;2002

3. Single-track circuit codes;IEEE Transactions on Information Theory;2001

4. An upper bound on the size of the snake-in-the-box;Combinatorica;1997-06

5. An Upper Bound for the Length of a Snake in the n-Dimensional Unit Cube;Operations Research and Discrete Analysis;1997