{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:05:01Z","timestamp":1766178301555},"reference-count":3,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0012-365x(78)90164-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"323","source":"Crossref","is-referenced-by-count":8,"title":["On graphs with hamiltonian squares"],"prefix":"10.1016","volume":"21","author":[{"given":"P.","family":"Underground","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90164-4_BIB1","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cock","year":"1970","journal-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0012-365X(78)90164-4_BIB2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0095-8956(74)90091-4","article-title":"The square of every two-connected graph is Hamiltonian","volume":"16","author":"Fleischner","year":"1974","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0012-365X(78)90164-4_BIB3","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901644?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901644?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:20:17Z","timestamp":1555154417000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78901644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":3,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78901644"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90164-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}