{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T05:18:44Z","timestamp":1698038324544},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":9360,"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":[[1987,12]]},"DOI":"10.1016\/0095-8956(87)90001-3","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"245-252","source":"Crossref","is-referenced-by-count":6,"title":["A Chv\u00e1tal-Erd\u00f6s condition for hamilton cycles in digraphs"],"prefix":"10.1016","volume":"43","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(87)90001-3_BIB1","author":"Chakroun","year":"1986"},{"key":"10.1016\/0095-8956(87)90001-3_BIB2","first-page":"111","article-title":"A note on Hamiltonian circuits","volume":"19","author":"Chv\u00e1tal","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(87)90001-3_BIB3","series-title":"Cycles in Graphs","first-page":"287","article-title":"Minimum number of circuits covering the vertices of a strong digraph","author":"Heydeman","year":"1985"},{"key":"10.1016\/0095-8956(87)90001-3_BIB4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(85)90169-4","article-title":"A Chv\u00e1tal-Erd\u00f6s condition for (1, 1)-factors in digraphs","volume":"57","author":"Jackson","year":"1985","journal-title":"Discrete Math"},{"key":"10.1016\/0095-8956(87)90001-3_BIB5","unstructured":"B. Jackson and O. Ordaz, Ch\u00e1tal-Erd\u00f6s conditions for 2-cyclability in digraphs, Ars Combin, in press."},{"key":"10.1016\/0095-8956(87)90001-3_BIB6","first-page":"231","article-title":"Long cycles in digraphs","volume":"42","author":"Thomassen","year":"1981"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895687900013?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895687900013?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:54:42Z","timestamp":1548777282000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895687900013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0095895687900013"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(87)90001-3","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}