{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:39:14Z","timestamp":1649183954195},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,29]],"date-time":"2011-12-29T00:00:00Z","timestamp":1325116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-011-1121-3","type":"journal-article","created":{"date-parts":[[2011,12,28]],"date-time":"2011-12-28T09:20:09Z","timestamp":1325064009000},"page":"637-660","source":"Crossref","is-referenced-by-count":1,"title":["Bounded Degree, Triangle Avoidance Graph Games"],"prefix":"10.1007","volume":"29","author":[{"given":"Nishali","family":"Mehta","sequence":"first","affiliation":[]},{"given":"\u00c1kos","family":"Seress","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,12,29]]},"reference":[{"key":"1121_CR1","doi-asserted-by":"crossref","first-page":"3653","DOI":"10.1016\/j.disc.2010.09.007","volume":"310","author":"J. Balogh","year":"2010","unstructured":"Balogh J., Butterfield J.: Online Ramsey games for triangles in random graphs. Discret. Math. 310, 3653\u20133657 (2010)","journal-title":"Discret. Math."},{"key":"1121_CR2","unstructured":"Bir\u00f3, Cs., Horn, P., Wildstrom, D.J.: On Hajnal\u2019s triangle-free game. http:\/\/www.renyi.hu\/conferences\/hajnal80\/Biro.pdf (in preparation)"},{"key":"1121_CR3","first-page":"211","volume":"153","author":"S.C. Cater","year":"2001","unstructured":"Cater S.C., Harary F., Robinson R.W.: One-color triangle avoidance games. Congressus Numerantium 153, 211\u2013221 (2001)","journal-title":"Congressus Numerantium"},{"key":"1121_CR4","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1017\/S0963548303005881","volume":"12","author":"E. Friedgut","year":"2003","unstructured":"Friedgut E., Kohayakawa Y., R\u00f6dl V., Ruci\u0144ski A., Tetali P.: Ramsey games against a one-armed bandit. Comb. Probab. Comput. 12, 515\u2013545 (2003)","journal-title":"Comb. Probab. Comput."},{"key":"1121_CR5","first-page":"123","volume":"82","author":"Z. F\u00fcredi","year":"1991","unstructured":"F\u00fcredi Z., Reimer D., Seress \u00c1.: Hajnal\u2019s triangle-free game and extremal graph problems. Congressus Numerantium 82, 123\u2013128 (1991)","journal-title":"Congressus Numerantium"},{"key":"1121_CR6","unstructured":"Gordinowicz, P., Pralat, P.: The first player wins the one-colour triangle avoidance game on 16 vertices. Discussiones Mathematicae Graph Theory"},{"key":"1121_CR7","first-page":"111","volume":"13","author":"F. Harary","year":"1982","unstructured":"Harary F.: Achievement and avoidance games for graphs. Ann. Discret. Math. 13, 111\u2013119 (1982)","journal-title":"Ann. Discret. Math."},{"key":"1121_CR8","unstructured":"Harary, F., Slany, W., Verbitsky, O.: A Symmetric Strategy in Graph Avoidance Games. More Games of No Chance, vol. 42, pp. 369\u2013381. MSRI Publications, Kuala Lumpur (2002)"},{"issue":"# 8","key":"1121_CR9","doi-asserted-by":"crossref","first-page":"2248","DOI":"10.1016\/j.ejc.2007.04.004","volume":"28","author":"M. Marciniszyn","year":"2007","unstructured":"Marciniszyn M., Mitsche D., Stojakovi\u0107 M.: Online balanced graph avoidance games. Eur. J. Comb. 28(# 8), 2248\u20132263 (2007)","journal-title":"Eur. J. Comb."},{"key":"1121_CR10","doi-asserted-by":"crossref","unstructured":"Marciniszyn, M., Sp\u00f6hel, R., Steger, A.: The Online Clique Avoidance Game on Random Graphs. Lecture Notes in Computer Science, vol. 3624, pp. 390\u2013401 (2005)","DOI":"10.1007\/11538462_33"},{"key":"1121_CR11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1017\/S0963548308009620","volume":"18","author":"M. Marciniszyn","year":"2009","unstructured":"Marciniszyn M., Sp\u00f6hel R., Steger A.: Upper bounds for online Ramsey games in random graphs. Comb. Probab. Comput. 18, 259\u2013270 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"1121_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1017\/S0963548308009632","volume":"18","author":"M. Marciniszyn","year":"2009","unstructured":"Marciniszyn M., Sp\u00f6hel R., Steger A.: Online Ramsey games in random graphs. Comb. Probab. Comput. 18, 271\u2013300 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"1121_CR13","unstructured":"Mehta, N.: Graph Games, Ph.D. thesis, Ohio State University (2010)"},{"issue":"1","key":"1121_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/488","volume":"18","author":"N. Mehta","year":"2011","unstructured":"Mehta, N., Seress, \u00c1.: Connected, bounded degree, triangle avoidance games. Electron. J. Comb. 18(1), 1\u201337 (2011)","journal-title":"Electron. J. Comb."},{"key":"1121_CR15","first-page":"85","volume":"75","author":"P. Pralat","year":"2010","unstructured":"Pralat P.: A note on the one-colour avoidance game on graphs. J. Comb. Math. Comb. Comput. 75, 85\u201394 (2010)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"1121_CR16","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01271710","volume":"8","author":"\u00c1. Seress","year":"1992","unstructured":"Seress \u00c1.: On Hajnal\u2019s triangle-free game. Graphs Comb. 8, 75\u201379 (1992)","journal-title":"Graphs Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1121-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1121-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1121-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T12:33:17Z","timestamp":1593433997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1121-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,29]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1121"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1121-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,29]]}}}