{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:04:39Z","timestamp":1777539879362,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T00:00:00Z","timestamp":1519689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Research, Development and Innovation Office\u2014NKFIH","award":["SNN 116095"],"award-info":[{"award-number":["SNN 116095"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00373-018-1883-y","type":"journal-article","created":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T11:57:48Z","timestamp":1519732668000},"page":"415-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the Game Total Domination Number"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0511-5291","authenticated-orcid":false,"given":"Csilla","family":"Bujt\u00e1s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,27]]},"reference":[{"key":"1883_CR1","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/100786800","volume":"24","author":"B Bre\u0161ar","year":"2010","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F.: Domination game and an imagination strategy. SIAM J. Discrete Math. 24, 979\u2013991 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"1883_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2014.04.015","volume":"330","author":"B Bre\u0161ar","year":"2014","unstructured":"Bre\u0161ar, B., Dorbec, P., Klav\u017ear, S., Ko\u0161mrlj, G.: Domination game: effect of edge- and vertex-removal. Discrete Math. 330, 1\u201310 (2014)","journal-title":"Discrete Math."},{"key":"1883_CR3","unstructured":"Bujt\u00e1s, Cs.: Domination game on trees without leaves at distance four. In: Frank, A., Recski, A., Wiener, G. (eds.) Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, Veszpr\u00e9m, pp. 73\u201378 (2013)"},{"key":"1883_CR4","doi-asserted-by":"publisher","first-page":"2220","DOI":"10.1016\/j.disc.2015.05.022","volume":"338","author":"Cs Bujt\u00e1s","year":"2015","unstructured":"Bujt\u00e1s, Cs: Domination game on forests. Discrete Math. 338, 2220\u20132228 (2015)","journal-title":"Discrete Math."},{"key":"1883_CR5","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, Cs.: On the game domination number of graphs with given minimum degree. Electron. J. Combin. 22, #P3.29 (2015)","DOI":"10.37236\/4497"},{"key":"1883_CR6","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1137\/15M1049361","volume":"30","author":"Cs Bujt\u00e1s","year":"2016","unstructured":"Bujt\u00e1s, Cs, Henning, M.A., Tuza, Zs: Transversal game on hypergraphs and the $$\\frac{3}{4}$$ 3 4 -conjecture on the total domination game. SIAM J. Discrete Math. 30, 1830\u20131847 (2016)","journal-title":"SIAM J. Discrete Math."},{"key":"1883_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.ejc.2016.07.003","volume":"59","author":"Cs Bujt\u00e1s","year":"2017","unstructured":"Bujt\u00e1s, Cs, Henning, M.A., Tuza, Zs: Bounds on the game transversal number in hypergraphs. Eur. J. Combin. 59, 34\u201350 (2017)","journal-title":"Eur. J. Combin."},{"key":"1883_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.dam.2016.03.014","volume":"208","author":"P Dorbec","year":"2016","unstructured":"Dorbec, P., Henning, M.A.: Game total domination for cycles and paths. Discrete Appl. Math. 208, 7\u201318 (2016)","journal-title":"Discrete Appl. Math."},{"key":"1883_CR9","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"1883_CR10","doi-asserted-by":"publisher","first-page":"2620","DOI":"10.1016\/j.disc.2016.05.014","volume":"339","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Rall, D.F.: Progress towards the total domination game $$\\frac{3}{4}$$ 3 4 -conjecture. Discrete Math. 339, 2620\u20132627 (2016)","journal-title":"Discrete Math."},{"key":"1883_CR11","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1007\/s00373-014-1470-9","volume":"31","author":"MA Henning","year":"2015","unstructured":"Henning, M.A., Klav\u017ear, S., Rall, D.F.: Total version of the domination game. Graphs Combin. 31, 1453\u20131462 (2015)","journal-title":"Graphs Combin."},{"key":"1883_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s00493-015-3316-3","volume":"31","author":"MA Henning","year":"2017","unstructured":"Henning, M.A., Klav\u017ear, S., Rall, D.F.: The 4\/5 upper bound on the game total domination number. Combinatorica 31, 223\u2013251 (2017)","journal-title":"Combinatorica"},{"key":"1883_CR13","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/120884742","volume":"27","author":"WB Kinnersley","year":"2013","unstructured":"Kinnersley, W.B., West, D.B., Zamani, R.: Extremal problems for game domination number. SIAM J. Discrete Math. 27, 2090\u20132107 (2013)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1883-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1883-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1883-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T19:47:20Z","timestamp":1603914440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1883-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,27]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1883"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1883-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,27]]},"assertion":[{"value":"4 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}