{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:45Z","timestamp":1740107145946,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T00:00:00Z","timestamp":1538524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1922-8","type":"journal-article","created":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T04:50:55Z","timestamp":1538542255000},"page":"1131-1145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Hamiltonicity of the k-Regular Graph Game"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-4388","authenticated-orcid":false,"given":"Jeremy","family":"Meza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,3]]},"reference":[{"issue":"1","key":"1922_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/rsa.20392","volume":"41","author":"S Ben-Shimon","year":"2012","unstructured":"Ben-Shimon, S., Ferber, A., Hefetz, D., Krivelevich, M.: Hitting time re- sults for Maker\u2013Breaker games. Random Struct. Algor. 41(1), 23\u201346 (2012)","journal-title":"Random Struct. Algor."},{"issue":"2","key":"1922_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0195-6698(83)80039-0","volume":"4","author":"B Bollob\u00e1s","year":"1983","unstructured":"Bollob\u00e1s, B.: Almost all regular graphs are Hamiltonian. Eur. J. Combin. 4(2), 97\u2013106 (1983). https:\/\/doi.org\/10.1016\/S0195-6698(83)80039-0","journal-title":"Eur. J. Combin."},{"issue":"4","key":"1922_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s, B.: Probabilistic proof of an asymptotic formula for the number of labelled regular graphs. Eur. J. Combin. 1(4), 311\u2013316 (1980). https:\/\/doi.org\/10.1016\/S0195-6698(80)80030-8","journal-title":"Eur. J. Combin."},{"issue":"2","key":"1922_CR4","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0095-8956(84)90066-2","volume":"37","author":"TI Fenner","year":"1984","unstructured":"Fenner, T.I., Frieze, A.M.: Hamiltonian cycles in random regular graphs. J. Combin. Theory Ser. B 37(2), 103\u2013112 (1984)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"1922_CR5","doi-asserted-by":"crossref","first-page":"2.26","DOI":"10.37236\/3942","volume":"21","author":"M Alan","year":"2014","unstructured":"Alan, M.: Frieze and Wesley Pegden, the topology of competitively constructed graphs. Electr. J. Comb. 21(2), 2.26 (2014)","journal-title":"Electr. J. Comb."},{"issue":"1","key":"1922_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/rsa.20252","volume":"34","author":"D Hefetz","year":"2009","unstructured":"Hefetz, D., Krivelevich, M., Stojakovi\u0107, M., Szab\u00f3, T.: A sharp threshold for the Hamilton cycle Maker-Breaker game. Random Struct. Algor. 34(1), 112\u2013122 (2009)","journal-title":"Random Struct. Algor."},{"issue":"1","key":"1922_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1090\/S0894-0347-2010-00678-9","volume":"24","author":"M Krivelevich","year":"2011","unstructured":"Krivelevich, M.: The critical bias for the Hamiltonicity game is, $$(1+ o(1)) \\frac{n}{\\ln n}$$ ( 1 + o ( 1 ) ) n ln n . J. Am. Math. Soc. 24(1), 125\u2013131 (2011)","journal-title":"J. Am. Math. Soc."},{"issue":"2","key":"1922_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/rsa.3240030202","volume":"3","author":"RW Robinson","year":"1992","unstructured":"Robinson, R.W., Wormald, N.C.: Almost all cubic graphs are Hamiltonian. Random Struct. Algor. 3(2), 117\u2013125 (1992)","journal-title":"Random Struct. Algor."},{"issue":"2","key":"1922_CR9","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1002\/rsa.3240050209","volume":"5","author":"RW Robinson","year":"1994","unstructured":"Robinson, R.W., Wormald, N.C.: Almost all regular graphs are Hamiltonian. Random Struct. Algor. 5(2), 363\u2013374 (1994)","journal-title":"Random Struct. Algor."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1922-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1922-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1922-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,11]],"date-time":"2020-11-11T22:38:53Z","timestamp":1605134333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1922-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,3]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1922"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1922-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,10,3]]},"assertion":[{"value":"6 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2015","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}