{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T17:28:19Z","timestamp":1719941299475},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T00:00:00Z","timestamp":1400198400000},"content-version":"vor","delay-in-days":135,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1016\/j.ejc.2013.06.015","type":"journal-article","created":{"date-parts":[[2013,7,4]],"date-time":"2013-07-04T19:45:14Z","timestamp":1372967114000},"page":"169-183","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["Weak and strong k<\/mml:mi><\/mml:math>-connectivity games"],"prefix":"10.1016","volume":"35","author":[{"given":"Asaf","family":"Ferber","sequence":"first","affiliation":[]},{"given":"Dan","family":"Hefetz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2013.06.015_br000005","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(01)00224-2","article-title":"Ramsey games","volume":"249","author":"Beck","year":"2002","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.ejc.2013.06.015_br000010","series-title":"Combinatorial Games: Tic-Tac-Toe Theory","author":"Beck","year":"2008"},{"issue":"1","key":"10.1016\/j.ejc.2013.06.015_br000015","doi-asserted-by":"crossref","first-page":"P144","DOI":"10.37236\/631","article-title":"Winning strong games through fast strategies for weak games","volume":"18","author":"Ferber","year":"2011","journal-title":"The Electronic Journal of Combinatorics"},{"key":"10.1016\/j.ejc.2013.06.015_br000020","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.ejc.2012.01.007","article-title":"Fast embedding of spanning trees in biased Maker\u2013Breaker games","volume":"33","author":"Ferber","year":"2012","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"10.1016\/j.ejc.2013.06.015_br000025","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejc.2011.07.005","article-title":"On the clique-game","volume":"33","author":"Gebauer","year":"2012","journal-title":"European Journal of Combinatorics"},{"key":"10.1016\/j.ejc.2013.06.015_br000030","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.jctb.2008.04.001","article-title":"Fast winning strategies in Maker\u2013Breaker games","volume":"99","author":"Hefetz","year":"2009","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"10.1016\/j.ejc.2013.06.015_br000035","doi-asserted-by":"crossref","first-page":"R28","DOI":"10.37236\/117","article-title":"On two problems regarding the Hamilton cycle game","volume":"16","author":"Hefetz","year":"2009","journal-title":"The Electronic Journal of Combinatorics"},{"key":"10.1016\/j.ejc.2013.06.015_br000040","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0112059","article-title":"A solution of the Shannon switching game","volume":"12","author":"Lehman","year":"1964","journal-title":"Journal of Society for Industrial and Applied Mathematics"},{"key":"10.1016\/j.ejc.2013.06.015_br000045","series-title":"Introduction to Graph Theory","author":"West","year":"2001"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019566981300125X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S019566981300125X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T01:24:03Z","timestamp":1660267443000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S019566981300125X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":9,"alternative-id":["S019566981300125X"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2013.06.015","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2014,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Weak and strong -connectivity games","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2013.06.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}