{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:28:58Z","timestamp":1773080938048,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":9482,"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":[[1987,8]]},"DOI":"10.1016\/0012-365x(87)90122-1","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"103-107","source":"Crossref","is-referenced-by-count":16,"title":["A note on short cycles in diagraphs"],"prefix":"10.1016","volume":"66","author":[{"given":"C.T","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(87)90122-1_BIB1","series-title":"Proc. Ninth SE Conf. Combinatorics, Graph Theory and Computing","first-page":"181","article-title":"On minimal diagraphs with given girth","author":"Caccetta","year":"1978"},{"key":"10.1016\/0012-365X(87)90122-1_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0095-8956(83)90059-X","article-title":"Short cycles in directed graphs","volume":"35","author":"Chv\u00e1tal","year":"1983","journal-title":"J. Combin Theory Ser. B"},{"key":"10.1016\/0012-365X(87)90122-1_BIB3","unstructured":"Y.Y. Hamildoune, On girth in digraphs, to appear."},{"key":"10.1016\/0012-365X(87)90122-1_BIB4","unstructured":"C. Thomassen, On 2-linkages in acyclic digraphs, to appear."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901221?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X87901221?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T11:55:00Z","timestamp":1553946900000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X87901221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":4,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0012365X87901221"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(87)90122-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}