{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T23:23:34Z","timestamp":1648941814349},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"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":7929,"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":[[1991,11]]},"DOI":"10.1016\/0012-365x(91)90305-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"45-52","source":"Crossref","is-referenced-by-count":1,"title":["On the largest strong components in m-out digraphs"],"prefix":"10.1016","volume":"94","author":[{"given":"W.C.Stephen","family":"Suen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90305-L_BIB1","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0012-365X(91)90305-L_BIB2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02579431","article-title":"On the connectivity of random m-orientable graphs and digraphs","volume":"2","author":"Fenner","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(91)90305-L_BIB3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(83)90046-8","article-title":"On the existence of Hamilton cycles in a class of random graphs","volume":"45","author":"Fenner","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90305-L_BIB4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0095-8956(88)90089-5","article-title":"Finding Hamilton cycles in random graphs","volume":"44","author":"Frieze","year":"1988","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(91)90305-L_BIB5","series-title":"Algorithmic Graph Theory","author":"Gibbons","year":"1985"},{"key":"10.1016\/0012-365X(91)90305-L_BIB6","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(91)90305-L_BIB7","unstructured":"W.C.S. Suen, On depth first search trees in m-out digraphs, to appear."},{"key":"10.1016\/0012-365X(91)90305-L_BIB8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM. J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190305L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190305L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:22:34Z","timestamp":1555136554000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190305L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["0012365X9190305L"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90305-l","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}