{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:59:48Z","timestamp":1774367988372,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1007\/bf01200911","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T10:38:30Z","timestamp":1108723110000},"page":"287-298","source":"Crossref","is-referenced-by-count":12,"title":["An upper bound on the size of the snake-in-the-box"],"prefix":"10.1007","volume":"17","author":[{"given":"Gilles","family":"Z\ufffdmor","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Some Problems in Combinatorial Analysis","author":"H. L. Abbot","year":"1965","unstructured":"H. L. Abbot: Some Problems in Combinatorial Analysis, PhD thesis, University of Alberta, Edmonton, Canada, 1965."},{"key":"CR2","first-page":"97","volume":"40","author":"H. L. Abbot","year":"1991","unstructured":"H. L. Abbot andM. Katchalski: On the construction of snake in the box codes,Utilitas Mathematica,40 (1991), 97?116.","journal-title":"Utilitas Mathematica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0021-9800(67)80026-7","volume":"2","author":"L. Danzer","year":"1967","unstructured":"L. Danzer andV. Klee: Length of snakes in boxes,J. Combin. Theory,2 (1967), 258?265.","journal-title":"J. Combin. Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579373","volume":"5","author":"K. Deimer","year":"1985","unstructured":"K. Deimer: A new upper bound for the length of snakes,Combinatorica,5 (1985), 109?120.","journal-title":"Combinatorica"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/S0021-9800(69)80013-X","volume":"7","author":"R. J. Douglas","year":"1969","unstructured":"R. J. Douglas: Upper bounds on the length of circuits of even spread in thed-cube,J. Combin. Theory,7 (1969), 206?214.","journal-title":"J. Combin. Theory"},{"key":"CR6","first-page":"309","volume":"6","author":"A. A. Evdomikov","year":"1969","unstructured":"A. A. Evdomikov: Maximal length of a circuit in a unitaryn-dimensional cube,Mat. Zametki,6 (1969), 309?329.","journal-title":"Mat. Zametki"},{"key":"CR7","first-page":"3","volume":"6","author":"V. V. Glagolev","year":"1966","unstructured":"V. V. Glagolev: An upper estimate of the length of a cycle in then-dimensional unit cube,Diskretnyi Analiz,6 (1966), 3?7.","journal-title":"Diskretnyi Analiz"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TEC.1958.5222529","volume":"7","author":"W. H. Kautz","year":"1958","unstructured":"W. H. Kautz: Unit distance error checking codes,IRE Trans. Electron. Comput.,7 (1958), 179?180.","journal-title":"IRE Trans. Electron. Comput."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/S0021-9800(69)80013-X","volume":"7","author":"D. G. Larman","year":"1969","unstructured":"D. G. Larman: Circuit codes. quoted from [5],, 1968.","journal-title":"J. Combin. Theory"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1109\/PGEC.1966.264382","volume":"15","author":"R. C. Singleton","year":"1966","unstructured":"R. C. Singleton: Generalized snake-in-the-box codes,IEEE Trans. Electronic Computers, EC-15 (1966), 596?602.","journal-title":"IEEE Trans. Electronic Computers"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0012-365X(94)90039-6","volume":"133","author":"H. S. Snevily","year":"1994","unstructured":"H. S. Snevily: The snake-in-the-box problem: A new upper bound,Discrete Math.,133 (1994), 307?314.","journal-title":"Discrete Math."},{"key":"CR12","unstructured":"F. I. Solov'jeva: An upper bound for the length of a cycle in ann-dimensional unit cube,Diskretnyi Analiz,45 (1987)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200911.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200911\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:58:28Z","timestamp":1556715508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["BF01200911"],"URL":"https:\/\/doi.org\/10.1007\/bf01200911","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}