{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:09:43Z","timestamp":1758823783996},"reference-count":13,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5601,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Graph Theory"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1002\/(sici)1097-0118(200005)34:1<42::aid-jgt5>3.0.co;2-h","type":"journal-article","created":{"date-parts":[[2004,11,9]],"date-time":"2004-11-09T15:38:02Z","timestamp":1100014682000},"page":"42-59","source":"Crossref","is-referenced-by-count":12,"title":["Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk"],"prefix":"10.1002","volume":"34","author":[{"given":"B.","family":"Bollob\ufffds","sequence":"first","affiliation":[]},{"given":"C.","family":"Cooper","sequence":"additional","affiliation":[]},{"given":"T. I.","family":"Fenner","sequence":"additional","affiliation":[]},{"given":"A. M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB1","volume-title":"Random graphs","author":"Bollob\ufffds","year":"1985","unstructured":"Random graphs, Academic, New York, 1985."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1017\/CBO9780511983917.006","volume-title":"A tribute to Paul Erdos","author":"Bollob\ufffds","year":"1990","unstructured":"and ?Hamilton cycles in random graphs of minimal degree at least k,? A tribute to Paul Erdos, and (Editors), 1990, pp. 59-96."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB3","first-page":"322","volume-title":"On the satisfiability and maximum satisfiability of random 3-CNF formulas","author":"Broder","year":"1993","unstructured":"and On the satisfiability and maximum satisfiability of random 3-CNF formulas, Proc Fourth Ann ACM-SIAM Symp Discr Algorith, ACM New York and SIAM Philadelphia 1993 pp. 322-330."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB4","volume-title":"Probability: theory and examples","author":"Durrett","year":"1991","unstructured":"Probability: theory and examples, Wadsworth & Brooks Cole, 1991."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(83)90046-8","volume":"45","author":"Fenner","year":"1983","journal-title":"Discr Math"},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB6","volume-title":"Theory of probability","author":"Gnedenko","year":"1963","unstructured":"Theory of probability, Chelsea, New York, 1963."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB7","volume-title":"Mathematical foundations of statistical mechanics","author":"Kinchin","year":"1949","unstructured":"Mathematical foundations of statistical mechanics, Dover, New York, 1949."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB8","volume-title":"Random mappings","author":"Kolchin","year":"1986","unstructured":"Random mappings, Optimization Software, New York, 1986."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB9","author":"Pittel","year":"1993","unstructured":"Private communication, 1993."},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB10","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1006\/aama.1996.0523","volume":"18","author":"Pittel","year":"1997","journal-title":"Adv Appl Math"},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB11","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1137\/0150073","volume":"50","author":"Pittel","year":"1990","journal-title":"SIAM J Appl Math"},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB12","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"P\ufffdsa","year":"1976","journal-title":"Discr Math"},{"key":"10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H-BIB13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1002\/rsa.3240050209","volume":"5.2","author":"Robinson","year":"1994","journal-title":"Random Struc Algorith"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0118(200005)34:1%3C42::AID-JGT5%3E3.0.CO;2-H","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0118(200005)34:1%3C42::AID-JGT5%3E3.0.CO;2-H","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T09:25:24Z","timestamp":1625131524000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0118(200005)34:1<42::AID-JGT5>3.0.CO;2-H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,5]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0118(200005)34:1<42::aid-jgt5>3.0.co;2-h","relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}