{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:12:48Z","timestamp":1648595568665},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":9329,"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":[[1988]]},"DOI":"10.1016\/0012-365x(88)90089-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"149-158","source":"Crossref","is-referenced-by-count":0,"title":["Partitioning random graphs into large cycles"],"prefix":"10.1016","volume":"70","author":[{"given":"A.M.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(88)90089-1_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0195-6698(83)80039-0","article-title":"Almost all regular graphs are Hamiltonian","volume":"4","author":"Bollob\u00e1s","year":"1983","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0012-365X(88)90089-1_BIB2","first-page":"23","article-title":"On matchings and Hamilton cycles in random graphs","volume":"28","author":"Bollob\u00e1s","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(88)90089-1_BIB3","first-page":"430","article-title":"An algorithm for finding Hamilton cycles in random graphs","author":"Bollob\u00e1s","year":"1985","journal-title":"Proc. 17th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0012-365X(88)90089-1_BIB4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02066689","article-title":"On the strength of connectedness of a random graphs","volume":"12","author":"Erd\u00f6s","year":"1961","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"key":"10.1016\/0012-365X(88)90089-1_BIB5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(83)90046-8","article-title":"Hamilton cycles in a class of random graphs","volume":"45","author":"Fenner","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90089-1_BIB6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0095-8956(84)90066-2","article-title":"Hamilton cycles in random regular graphs","volume":"37","author":"Fenner","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(88)90089-1_BIB7","unstructured":"A.M. Frieze, Limit distribution for the existence of Hamilton cycles in a random bipartite graph, Europ. J. Combin., to appear."},{"key":"10.1016\/0012-365X(88)90089-1_BIB8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0012-365X(86)90171-8","article-title":"On large matchings and cycles in sparse random graphs","volume":"59","author":"Frieze","year":"1986","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90089-1_BIB9","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1137\/0216068","article-title":"On the exact solution of random travelling salesman problems with medium sized integer costs","volume":"16","author":"Frieze","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(88)90089-1_BIB10","unstructured":"A.M. Frieze, Finding Hamilton cycles in sparse random graphs, to appear."},{"key":"10.1016\/0012-365X(88)90089-1_BIB11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","article-title":"Limit distribution for the existence of Hamilton cycles in a random graph","volume":"43","author":"Koml\u00f3s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(88)90089-1_BIB12","unstructured":"T. Luczak, k-leaf connectivity of a random graph, to appear."},{"key":"10.1016\/0012-365X(88)90089-1_BIB13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BFb0120903","article-title":"Clutter percolation and random graphs","volume":"13","author":"McDiarmid","year":"1980","journal-title":"Math. Programming Study"},{"key":"10.1016\/0012-365X(88)90089-1_BIB14","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"Posa","year":"1976","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88900891?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X88900891?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:27:11Z","timestamp":1555133231000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X88900891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988]]}},"alternative-id":["0012365X88900891"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(88)90089-1","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1988]]}}}