Author:
Abbott H.L.,Katchalski M.
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference8 articles.
1. Snakes in powers of complete graphs;Abbott;SIAM J. Appl. Math.,1977
2. Lengths of snakes in boxes;Danzer;J. Combin. Theory,1966
3. Maximal length of a circuit in a unitary n-dimensional cube;Evdokimov;Mat. Zametki,1969
4. Unit distance error checking codes;Kautz;IEEE Trans. Elect. Comp.,1958
5. What is the maximum length of a d-dimensional snake?;Klee;Amer. Math. Monthly,1970
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Snake-in-the-Box problem;Proceedings of the 48th Annual Southeast Regional Conference on - ACM SE '10;2010
2. ON THE LENGTH OF SNAKES IN POWERS OF COMPLETE GRAPHS;Journal of the London Mathematical Society;2005-02
3. k-Pseudosnakes in n-dimensional Hypercubes;Electronic Notes in Discrete Mathematics;2004-10
4. Factorizations of and by powers of complete graphs;Discrete Mathematics;2002-01
5. k-pseudosnakes in Large Grids;LATIN 2002: Theoretical Informatics;2002