{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T06:13:51Z","timestamp":1649052831145},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6713,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0195-6698(95)90057-8","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T00:27:27Z","timestamp":1091665647000},"page":"185-189","source":"Crossref","is-referenced-by-count":0,"title":["Thin Hamiltonian cycles on Archimedean graphs"],"prefix":"10.1016","volume":"16","author":[{"given":"John R","family":"Reay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.G","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0195-6698(95)90057-8_BIB1","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0097-3165(87)90063-X","article-title":"The boundary characteristic and Pick's theorem in the Archimedean planar tilings","volume":"44","author":"Ding","year":"1987","journal-title":"J. Combin. Theory, Ser. A"},{"key":"10.1016\/0195-6698(95)90057-8_BIB2","unstructured":"D. Fisher, K. Collins and L. Krompart, A note on Hamiltonian paths and cycles in rectangular grid graphs Research Report, University of Colorado, Denver."},{"key":"10.1016\/0195-6698(95)90057-8_BIB3","series-title":"Tilings and Patterns","author":"Gr\u00fcnbaum","year":"1987"},{"key":"10.1016\/0195-6698(95)90057-8_BIB4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2323771","article-title":"Pick's theorem","volume":"100","author":"Gr\u00fcnbaum","year":"1993","journal-title":"Am. Math. Monthly"},{"key":"10.1016\/0195-6698(95)90057-8_BIB5","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/0195-6698(92)90005-K","article-title":"D\u00e9nombrement des cycles Hamiltoniens dans un rectangle quadrill\u00e9","volume":"13","author":"Kreweras","year":"1992","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90057-8_BIB6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/eujc.1994.1031","article-title":"A matrix method for counting Hamiltonian cycles on grid graphs","volume":"15","author":"Kwong","year":"1994","journal-title":"Europ. J. Combin."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900578?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900578?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:34:31Z","timestamp":1549326871000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0195669895900578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["0195669895900578"],"URL":"https:\/\/doi.org\/10.1016\/0195-6698(95)90057-8","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}