{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:14:57Z","timestamp":1765545297263},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"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":12585,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1979,2]]},"DOI":"10.1016\/0095-8956(79)90041-8","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"50-65","source":"Crossref","is-referenced-by-count":7,"title":["Hamiltonian squares of cacti"],"prefix":"10.1016","volume":"26","author":[{"given":"Arthur M","family":"Hobbs","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(79)90041-8_BIB1","author":"Behzad","year":"1972"},{"key":"10.1016\/0095-8956(79)90041-8_BIB2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0095-8956(75)90078-7","article-title":"A necessary condition for the square of a graph to be Hamiltonian","volume":"19","author":"Fleischner","year":"1975","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(79)90041-8_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.4153\/CMB-1976-025-3","article-title":"Hamiltonian cycles in squares of vertex-unicyclic graphs","volume":"19","author":"Fleischner","year":"1976","journal-title":"Canad. Math. Bull. Ser. B"},{"key":"10.1016\/0095-8956(79)90041-8_BIB4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1112\/S0025579300008494","article-title":"Trees with Hamiltonian squares","volume":"18","author":"Harary","year":"1971","journal-title":"Mathematika"},{"key":"10.1016\/0095-8956(79)90041-8_BIB5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0095-8956(79)90040-6","article-title":"Maximal Hamiltonian cycles in squares of graphs","volume":"26","author":"Hobbs","year":"1979","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(79)90041-8_BIB6","doi-asserted-by":"crossref","first-page":"323","DOI":"10.21136\/CPM.1964.117510","article-title":"On a certain ordering of the vertices of a tree","volume":"89","author":"Neuman","year":"1964","journal-title":"Casopis Pest. Mat."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900418?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900418?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,4]],"date-time":"2021-07-04T22:54:20Z","timestamp":1625439260000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895679900418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0095895679900418"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(79)90041-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}