{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T18:47:45Z","timestamp":1771354065014,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,8,1]],"date-time":"1980-08-01T00:00:00Z","timestamp":333936000000},"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":12038,"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":[[1980,8]]},"DOI":"10.1016\/0095-8956(80)90042-8","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"27-46","source":"Crossref","is-referenced-by-count":85,"title":["Hamilton cycles in regular 2-connected graphs"],"prefix":"10.1016","volume":"29","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(80)90042-8_BIB1","series-title":"Advances in Graph Theory","article-title":"Hamiltonian cycles in regular graphs","author":"Bollob\u00e1s","year":"1978"},{"key":"10.1016\/0095-8956(80)90042-8_BIB2","first-page":"69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952"},{"key":"10.1016\/0095-8956(80)90042-8_BIB3","unstructured":"P. Erd\u00f6s and A. M. Hobbs, Hamilton cycles in regular graphs of moderate degree, J. Combinatorial Theory Ser. B, in press."},{"key":"10.1016\/0095-8956(80)90042-8_BIB4","unstructured":"R. H\u00e4ggkvist, personal communication."},{"key":"10.1016\/0095-8956(80)90042-8_BIB5","series-title":"Proceedings, Fifth Hungarian Colloquium on Combinatorics","article-title":"unsolved problem","author":"H\u00e4ggkvist","year":"1976"},{"key":"10.1016\/0095-8956(80)90042-8_BIB6","series-title":"Studies in Pure Mathematics","article-title":"Edge-disjoint hamiltonian circuits in graphs with vertices of large degree","author":"Nash-Williams","year":"1971"},{"key":"10.1016\/0095-8956(80)90042-8_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0095-8956(73)90038-5","article-title":"The binding number of a graph and its Anderson number","volume":"15","author":"Woodall","year":"1973","journal-title":"J. Combinatorial Theory Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895680900428?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895680900428?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:24:01Z","timestamp":1548761041000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895680900428"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,8]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,8]]}},"alternative-id":["0095895680900428"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(80)90042-8","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1980,8]]}}}