{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T17:18:00Z","timestamp":1697649480204},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"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":[[1989,3]]},"DOI":"10.1007\/bf02122688","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T11:12:28Z","timestamp":1126696348000},"page":"91-99","source":"Crossref","is-referenced-by-count":11,"title":["A new lower bound for Snake-in-the-Box Codes"],"prefix":"10.1007","volume":"9","author":[{"given":"J.","family":"Wojciechowski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02122688_CR1","volume-title":"Ph. D. thesis","author":"H. L. Abbott","year":"1965","unstructured":"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)."},{"key":"BF02122688_CR2","unstructured":"H. L.Abbott and M.Katchalski, On the Snake in the Box Problem, to appear inJ. Combinatorial Theory."},{"key":"BF02122688_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. K. Lee, Lentgh of Snakes inBoxes,J. Combinatorial Theory 2 (1967), 258\u2013265.","journal-title":"J. Combinatorial Theory"},{"key":"BF02122688_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1109\/PGEC.1965.264259","volume":"14","author":"D. W. Davies","year":"1965","unstructured":"D. W. Davies, Longest \u201cSeparated\u201d Paths and Loops in anN Cube,IEEE Trans. Electronic Computers 14 (1965), 261.","journal-title":"IEEE Trans. Electronic Computers"},{"issue":"2","key":"BF02122688_CR5","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 (2) (1985), 109\u2013120.","journal-title":"Combinatorica"},{"key":"BF02122688_CR6","first-page":"309","volume":"6","author":"A. A. Evdokimov","year":"1969","unstructured":"A. A. Evdokimov, The maximal length of a chanin the unitn-dimensional cube.Mat. Zametki 6 (1969), 309\u2013319. English translation inMath. Nmes 6 (1969), 642\u2013648.","journal-title":"Mat. Zametki"},{"key":"BF02122688_CR7","unstructured":"A. A.Evdokimov, The maximal length of a chain inn-dimensional cube and some"},{"key":"BF02122688_CR8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/PGEC.1963.263388","volume":"12","author":"S. Even","year":"1963","unstructured":"S. Even, Snake-in-the-Box Codes,IEEE Trans. Electronic Computers 12 (1963), 18.","journal-title":"IEEE Trans. Electronic Computers"},{"key":"BF02122688_CR9","first-page":"9","volume":"17","author":"V. V. Glagolev","year":"1970","unstructured":"V. V. Glagolev andA. A. Evdokimov, The minimal coloring of a certaing infinite graph,Diskret. Analiz 17 (1970), 9\u201317.","journal-title":"Diskret. Analiz"},{"key":"BF02122688_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TEC.1958.5222529","volume":"3","author":"W. H. Kautz","year":"1958","unstructured":"W. H. Kautz, Unit-Distance Error-Checking Codes,IRE trans. Electronic Computers 3 (1958), 179\u2013180.","journal-title":"IRE trans. Electronic Computers"},{"key":"BF02122688_CR11","first-page":"131","volume":"13","author":"C. Ramanujacharyulu","year":"1964","unstructured":"C. Ramanujacharyulu andV. V. Menon, A Note on the Snake-in-the-Box Problem,Publ. Inst. Statist. Univ. Paris 13 (1964), 131\u2013135.","journal-title":"Publ. Inst. Statist. Univ. Paris"},{"key":"BF02122688_CR12","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 15 (1966), 596\u2013602.","journal-title":"IEEE Trans. Electronic Computers"},{"key":"BF02122688_CR13","unstructured":"F. I.Solov'jeva, Upper bound for the length of a cycle in ann-dimensional unit cube,Methods of Diskrete Analiz 45 (1987)."},{"key":"BF02122688_CR14","first-page":"160","volume":"4","author":"Ju. I. Vasil'ev","year":"1963","unstructured":"Ju. I. Vasil'ev, On the Length of a Cycle in ann-Dimensional Unit Cube,Soviet Math. Dokl. 4 (1963), 160\u2013163 (transl. fromDokl. Acad. Nauk SSSR 184 (1963), 753\u2013756).","journal-title":"Soviet Math. Dokl."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122688.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122688\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:22:30Z","timestamp":1557796950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["BF02122688"],"URL":"https:\/\/doi.org\/10.1007\/bf02122688","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}