{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T13:42:21Z","timestamp":1706794941949},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"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":8508,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0304-3975(90)90053-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"419-424","source":"Crossref","is-referenced-by-count":19,"title":["A data structure useful for finding Hamiltonian cycles"],"prefix":"10.1016","volume":"71","author":[{"given":"M.","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Szymacha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Krawczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90053-K_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0304-3975(90)90053-K_BIB2","series-title":"Extremal Graphs Theory","author":"Bollobas","year":"1978"},{"key":"10.1016\/0304-3975(90)90053-K_BIB3","first-page":"359","article-title":"An algorithm for finding Hamilton cycles in a random graph","author":"Bollobas","year":"1975","journal-title":"Proc. 17th STOC"},{"key":"10.1016\/0304-3975(90)90053-K_BIB4","series-title":"Algorithms and Complexity, New Directions and Recent Results","first-page":"1","article-title":"The probabilistic analysis of some combinatorial search algorithms","author":"Karp","year":"1976"},{"key":"10.1016\/0304-3975(90)90053-K_BIB5","series-title":"Sorting and Searching, Vol. 3, The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(90)90053-K_BIB6","unstructured":"A. Krawczyk, unpublished results."},{"key":"10.1016\/0304-3975(90)90053-K_BIB7","first-page":"337","article-title":"Extensions of k-subsets to (k+1)-subsets\u2014existence versus constructability","volume":"23","author":"Poljak","year":"1982","journal-title":"Comment. Math. Univ. Carolin."},{"key":"10.1016\/0304-3975(90)90053-K_BIB8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamilton circuits in random graphs","volume":"14","author":"Posa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(90)90053-K_BIB9","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0304-3975(90)90053-K_BIB10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","article-title":"Hamiltonian cycles and uniquely edge colourable graphs","volume":"3","author":"Thomason","year":"1978","journal-title":"Ann. Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090053K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090053K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:56:22Z","timestamp":1555062982000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090053K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["030439759090053K"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90053-k","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}