{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:44:01Z","timestamp":1787510641926,"version":"build-2736575974"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,13]],"date-time":"2016-04-13T00:00:00Z","timestamp":1460505600000},"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":["Combinatorica"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s00493-015-3316-3","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T04:10:13Z","timestamp":1460607013000},"page":"223-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["The 4\/5 upper bound on the game total domination number"],"prefix":"10.1007","volume":"37","author":[{"given":"Michael A.","family":"Henning","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Douglas F.","family":"Rall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,13]]},"reference":[{"key":"3316_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2014.04.015","volume":"330","author":"B. Bre\u0161ar","year":"2014","unstructured":"B. Bre\u0161ar, P. Dorbec, S. Klav\u017ear and G. Ko\u0161mrlj: Domination game: effect of edge- and vertex-removal, Discrete Math. 330 (2014), 1\u201310.","journal-title":"Discrete Math."},{"key":"3316_CR2","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/100786800","volume":"24","author":"B. Bre\u0161ar","year":"2010","unstructured":"B. Bre\u0161ar, S. Klav\u017ear and D. F. Rall: Domination game and an imagination strategy, SIAM J. Discrete Math. 24 (2010), 979\u2013991.","journal-title":"SIAM J. Discrete Math."},{"key":"3316_CR3","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1016\/j.disc.2013.01.014","volume":"313","author":"B. Bre\u0161ar","year":"2013","unstructured":"B. Bre\u0161ar, S. Klav\u017ear and D. F. Rall: Domination game played on trees and spanning subgraphs, Discrete Math. 313 (2013), 915\u2013923.","journal-title":"Discrete Math."},{"key":"3316_CR4","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1016\/j.dam.2013.01.025","volume":"161","author":"B. Bre\u0161ar","year":"2013","unstructured":"B. Bre\u0161ar, S. Klav\u017ear, G. Ko\u0161mrlj and D. F. Rall: Domination game: extremal families of graphs for the 3\/5-conjectures, Discrete Appl. Math. 161 (2013), 1308\u20131316.","journal-title":"Discrete Appl. Math."},{"key":"3316_CR5","first-page":"73","volume-title":"Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications","author":"C.s. Bujt\u00e1s","year":"2013","unstructured":"Cs. Bujt\u00e1s: Domination game on trees without leaves at distance four, in: Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications (A. Frank, A. Recski, G. Wiener, eds.), June 4\u20137, 2013, Veszpr\u00e9m, Hungary, 73\u201378."},{"key":"3316_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.37236\/4497","volume":"22","author":"C.s. Bujt\u00e1s","year":"2015","unstructured":"Cs. Bujt\u00e1s: On the game domination number of graphs with given minimum degree., Electron. J. Combin. 22 (2015), #P3.29","journal-title":"Electron. J. Combin."},{"key":"3316_CR7","doi-asserted-by":"publisher","first-page":"781","DOI":"10.7151\/dmgt.1839","volume":"35","author":"C.s. Bujt\u00e1s","year":"2015","unstructured":"Cs. Bujt\u00e1s, S. Klav\u017ear and G. Ko\u0161mrlj: Domination game critical graphs, Discuss. Math. Graph Theory 35 (2015), 781\u2013796.","journal-title":"Discuss. Math. Graph Theory"},{"key":"3316_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.disc.2014.08.024","volume":"338","author":"P. Dorbec","year":"2015","unstructured":"P. Dorbec, G. Ko\u0161mrlj and G. Renault: The domination game played on unions of graphs, Discrete Math. 338 (2015), 71\u201379.","journal-title":"Discrete Math."},{"key":"3316_CR9","volume-title":"Fundamentals of Domination in Graphs","author":"T. W. Haynes","year":"1998","unstructured":"T. W. Haynes, S. T. Hedetniemi and P. J. Slater: Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998."},{"key":"3316_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/140976935","volume":"30","author":"M. A. Henning","year":"2016","unstructured":"M. A. Henning and W. B. Kinnersley: Domination Game: A proof of the 3\/5-Conjecture for graphs with minimum degree at least two, SIAM J. Discrete Math. 30 (2016), 20\u201335.","journal-title":"SIAM J. Discrete Math."},{"key":"3316_CR11","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1007\/s00373-014-1470-9","volume":"31","author":"M. A. Henning","year":"2015","unstructured":"M. A. Henning, S. Klav\u017ear and D. F. Rall: Total version of the domination game, Graphs Combin. 31 (2015), 1453\u20131462","journal-title":"Graphs Combin."},{"key":"3316_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs.","author":"M. A. Henning","year":"2013","unstructured":"M. A. Henning and A. Yeo: Total Domination in Graphs., Springer Monographs in Mathematics, (2013)."},{"key":"3316_CR13","doi-asserted-by":"publisher","first-page":"2090","DOI":"10.1137\/120884742","volume":"27","author":"W. B. Kinnersley","year":"2013","unstructured":"W. B. Kinnersley, D. B. West and R. Zamani: Extremal problems for game domination number, SIAM J. Discrete Math. 27 (2013), 2090\u20132107.","journal-title":"SIAM J. Discrete Math."},{"key":"3316_CR14","volume-title":"Game domination for grid-like graphs","author":"W. B. Kinnersley","year":"2012","unstructured":"W. B. Kinnersley, D. B. West and R. Zamani: Game domination for grid-like graphs, manuscript, 2012."},{"key":"3316_CR15","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10878-012-9572-x","volume":"28","author":"G. Ko\u0161mrlj","year":"2014","unstructured":"G. Ko\u0161mrlj: Realizations of the game domination number, J. Comb. Optim. 28 (2014), 447\u2013461.","journal-title":"J. Comb. Optim."},{"key":"3316_CR16","unstructured":"R. Zamani: Hamiltonian cycles through specified edges in bipartite graphs, domination game, and the game of revolutionaries and spies, Ph. D. Thesis, University of Illinois at Urbana-Champaign, Pro-Quest\/UMI, Ann Arbor (Publication No. AAT 3496787)."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3316-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3316-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3316-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3316-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T12:51:17Z","timestamp":1600433477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3316-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,13]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["3316"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3316-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,13]]}}}