{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:11:23Z","timestamp":1758823883187},"reference-count":7,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90046-8","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:17:57Z","timestamp":1032283077000},"page":"301-305","source":"Crossref","is-referenced-by-count":30,"title":["On the existence of Hamiltonian cycles in a class of random graphs"],"prefix":"10.1016","volume":"45","author":[{"given":"T.I.","family":"Fenner","sequence":"first","affiliation":[]},{"given":"A.M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90046-8_BIB1","doi-asserted-by":"crossref","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(83)90046-8_BIB2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","article-title":"Limit distribution for the existence of hamiltonian cycles in random graphs","volume":"43","author":"Koml\u00f3s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90046-8_BIB3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.2307\/1426466","article-title":"General percolation and random graphs","volume":"13","author":"McDiarmid","year":"1981","journal-title":"Adv. Appl. Prob."},{"key":"10.1016\/0012-365X(83)90046-8_BIB4","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":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90046-8_BIB5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","article-title":"Matchings in random regular bipartite digraphs","volume":"31","author":"Walkup","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90046-8_BIB6","doi-asserted-by":"crossref","unstructured":"T.I. Fenner and A.M. Frieze, Hamiltonian cycles in random regular graphs, J. Combin. Theory, to appear.","DOI":"10.1016\/0095-8956(84)90066-2"},{"key":"10.1016\/0012-365X(83)90046-8_BIB7","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s, Almost all regular graphs are Hamiltonian, European J. Combinatorics, to appear.","DOI":"10.1016\/S0195-6698(83)80039-0"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83900468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83900468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:53:56Z","timestamp":1554825236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83900468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":7,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83900468"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90046-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}