{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:07:09Z","timestamp":1649023629015},"reference-count":6,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1985,11,1]],"date-time":"1985-11-01T00:00:00Z","timestamp":499651200000},"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":10120,"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":[[1985,11]]},"DOI":"10.1016\/0012-365x(85)90169-4","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"199-201","source":"Crossref","is-referenced-by-count":7,"title":["A Chv\u00e1tal-Erd\u00f6s condition for (1,1)-factors in digraphs"],"prefix":"10.1016","volume":"57","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscat","family":"Ordaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(85)90169-4_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(85)90169-4_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\/0012-365X(85)90169-4_BIB3","doi-asserted-by":"crossref","unstructured":"O. Favaron and O. Ordaz, A sufficient condition for oriented graphs to be hamiltonian, Discrete Math, to appear.","DOI":"10.1016\/0012-365X(86)90141-X"},{"key":"10.1016\/0012-365X(85)90169-4_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0012-365X(82)90078-4","article-title":"Circuits Through Specified Edges","volume":"41","author":"H\u00e4ggkvist","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(85)90169-4_BIB5","series-title":"Theory of Graphs","author":"Ore","year":"1962"},{"issue":"3","key":"10.1016\/0012-365X(85)90169-4_BIB6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1112\/plms\/s3-42.2.231","article-title":"Long cycles in Digraphs","volume":"42","author":"Thomassen","year":"1981","journal-title":"Proc. London Math. Soc."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85901694?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X85901694?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:52:04Z","timestamp":1553932324000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X85901694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,11]]},"references-count":6,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1985,11]]}},"alternative-id":["0012365X85901694"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(85)90169-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1985,11]]}}}