{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T07:00:59Z","timestamp":1775718059993,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:00:00Z","timestamp":1772496000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T00:00:00Z","timestamp":1772496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0297"],"award-info":[{"award-number":["P1-0297"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"abstract":"Abstract<\/jats:title>\n \n Given a graph\n G<\/jats:italic>\n and a family of graphs\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , an\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -isolating set, as introduced by Caro and Hansberg, is any set\n \n \n $$S\\subset V(G)$$<\/jats:tex-math>\n \n \n S<\/mml:mi>\n \u2282<\/mml:mo>\n V<\/mml:mi>\n (<\/mml:mo>\n G<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n such that\n \n \n $$G - N[S]$$<\/jats:tex-math>\n \n \n G<\/mml:mi>\n -<\/mml:mo>\n N<\/mml:mi>\n [<\/mml:mo>\n S<\/mml:mi>\n ]<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n contains no member of\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n as a subgraph. In this paper, we introduce a game in which two players with opposite goals are together building an\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -isolating set in\n G<\/jats:italic>\n . Following the domination games, Dominator (Staller) wants that the resulting\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -isolating set obtained at the end of the game, is as small (as big) as possible, which leads to the graph invariant called the game\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -isolation number, denoted\n \n \n $$\\iota _\\textrm{g}(G,\\mathcal F)$$<\/jats:tex-math>\n \n \n \n \u03b9<\/mml:mi>\n g<\/mml:mtext>\n <\/mml:msub>\n \n (<\/mml:mo>\n G<\/mml:mi>\n ,<\/mml:mo>\n F<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . We prove that the Continuation Principle holds in the\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -isolation game, and that the difference between the game\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -isolation numbers when either Dominator or Staller starts the game is at most 1. Considering two arbitrary families of graphs\n \n \n $$\\mathcal F$$<\/jats:tex-math>\n \n F<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n $$\\mathcal F'$$<\/jats:tex-math>\n \n \n F<\/mml:mi>\n \u2032<\/mml:mo>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , we find relations between them that ensure\n \n \n $$\\iota _\\textrm{g}(G,{\\mathcal {F}}') \\le \\iota _\\textrm{g}(G,{\\mathcal {F}})$$<\/jats:tex-math>\n \n \n \n \u03b9<\/mml:mi>\n g<\/mml:mtext>\n <\/mml:msub>\n \n (<\/mml:mo>\n G<\/mml:mi>\n ,<\/mml:mo>\n \n \n F<\/mml:mi>\n <\/mml:mrow>\n \u2032<\/mml:mo>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n \u2264<\/mml:mo>\n \n \u03b9<\/mml:mi>\n g<\/mml:mtext>\n <\/mml:msub>\n \n (<\/mml:mo>\n G<\/mml:mi>\n ,<\/mml:mo>\n F<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n for any graph\n G<\/jats:italic>\n . A special focus is given on the isolation game, which takes place when\n \n \n $$\\mathcal {F}=\\{K_2\\}$$<\/jats:tex-math>\n \n \n F<\/mml:mi>\n =<\/mml:mo>\n {<\/mml:mo>\n \n K<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n }<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . We prove that\n \n \n $$\\iota _\\textrm{g}(G,\\{K_2\\})\\le |V(G)|\/2$$<\/jats:tex-math>\n \n \n \n \u03b9<\/mml:mi>\n g<\/mml:mtext>\n <\/mml:msub>\n \n (<\/mml:mo>\n G<\/mml:mi>\n ,<\/mml:mo>\n \n {<\/mml:mo>\n \n K<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n }<\/mml:mo>\n <\/mml:mrow>\n )<\/mml:mo>\n <\/mml:mrow>\n \u2264<\/mml:mo>\n \n |<\/mml:mo>\n V<\/mml:mi>\n \n (<\/mml:mo>\n G<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n |<\/mml:mo>\n <\/mml:mrow>\n \/<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n for any graph\n G<\/jats:italic>\n , and conjecture that\n \n \n $$\\lceil 3|V(G)|\/7\\rceil $$<\/jats:tex-math>\n \n \n \u2308<\/mml:mo>\n 3<\/mml:mn>\n |<\/mml:mo>\n V<\/mml:mi>\n (<\/mml:mo>\n G<\/mml:mi>\n )<\/mml:mo>\n |<\/mml:mo>\n \/<\/mml:mo>\n 7<\/mml:mn>\n \u2309<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is the actual (sharp) upper bound. We prove that the isolation game on a forest when Dominator has the first move never lasts longer than the one in which Staller starts the game. Finally, we prove good lower and upper bounds on the game isolation numbers of paths\n \n \n $$P_n$$<\/jats:tex-math>\n \n \n P<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , which lead to the exact values\n \n \n $$\\iota _\\textrm{g}(P_n,\\{K_2\\})=\\left\\lfloor \\frac{2n+2}{5}\\right\\rfloor $$<\/jats:tex-math>\n \n \n \n \u03b9<\/mml:mi>\n g<\/mml:mtext>\n <\/mml:msub>\n \n (<\/mml:mo>\n \n P<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n ,<\/mml:mo>\n \n {<\/mml:mo>\n \n K<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msub>\n }<\/mml:mo>\n <\/mml:mrow>\n )<\/mml:mo>\n <\/mml:mrow>\n =<\/mml:mo>\n \n \n \n 2<\/mml:mn>\n n<\/mml:mi>\n +<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n 5<\/mml:mn>\n <\/mml:mfrac>\n <\/mml:mfenced>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n when\n \n \n $$n \\equiv i \\pmod 5$$<\/jats:tex-math>\n \n \n n<\/mml:mi>\n \u2261<\/mml:mo>\n i<\/mml:mi>\n \n (<\/mml:mo>\n mod<\/mml:mo>\n \n 5<\/mml:mn>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n and\n \n \n $$i \\in \\{1,2,3\\}.$$<\/jats:tex-math>\n \n \n i<\/mml:mi>\n \u2208<\/mml:mo>\n {<\/mml:mo>\n 1<\/mml:mn>\n ,<\/mml:mo>\n 2<\/mml:mn>\n ,<\/mml:mo>\n 3<\/mml:mn>\n }<\/mml:mo>\n .<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n <\/jats:p>","DOI":"10.1007\/s00373-026-03030-y","type":"journal-article","created":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T03:33:33Z","timestamp":1772508813000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Isolation Game on Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0540-0938","authenticated-orcid":false,"given":"Tanja","family":"Dravec","sequence":"additional","affiliation":[]},{"given":"Daniel P.","family":"Johnston","sequence":"additional","affiliation":[]},{"given":"Kirsti","family":"Kuenzel","sequence":"additional","affiliation":[]},{"given":"Douglas F.","family":"Rall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,3]]},"reference":[{"key":"3030_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111879","volume":"343","author":"P Borg","year":"2020","unstructured":"Borg, P., Fenech, K., Kaemawichanurat, P.: Isolation of $$k$$-cliques. Discrete Math. 343, 111879, 5 (2020)","journal-title":"Discrete Math."},{"key":"3030_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00026-022-00620-4","volume":"27","author":"P Borg","year":"2023","unstructured":"Borg, P., Kaemawichanurat, P.: Extensions of the Art Gallery Theorem. Ann. Comb. 27, 31\u201350 (2023)","journal-title":"Ann. Comb."},{"key":"3030_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2298\/AADM171126020B","volume":"13","author":"M Borowiecki","year":"2019","unstructured":"Borowiecki, M., Fiedorowicz, A., Sidorowicz, E.: Connected domination game. Appl. Anal. Discrete Math. 13, 261\u2013289 (2019)","journal-title":"Appl. Anal. Discrete Math."},{"key":"3030_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.dam.2024.05.022","volume":"356","author":"G Boyer","year":"2024","unstructured":"Boyer, G., Goddard, W.: Disjoint isolating sets and graphs with maximum isolation number. Discrete Appl. Math. 356, 110\u2013116 (2024)","journal-title":"Discrete Appl. Math."},{"key":"3030_CR5","doi-asserted-by":"crossref","unstructured":"Bre\u0161ar, B., Henning, M.A., Klav\u017ear, S., Rall, D.F.: Domination games played on graphs, SpringerBriefs in Mathematics, Springer, Cham, (2021), x+122 pp","DOI":"10.1007\/978-3-030-69087-8"},{"key":"3030_CR6","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":"3030_CR7","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, Cs.: On the game domination number of graphs with given minimum degree, Electron. J. Combin. 22 (2015) 3.29","DOI":"10.37236\/4497"},{"key":"3030_CR8","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, Cs., Klav\u017ear, S.: Improved upper bounds on the domination number of graphs with minimum degree at least five, Graphs Combin. 32 (2016) 511\u2013519","DOI":"10.1007\/s00373-015-1585-7"},{"key":"3030_CR9","doi-asserted-by":"crossref","unstructured":"Bujt\u00e1s, C.s., Tuza, Z.s.: Fractional domination game, Electron. J. Combin. 26 (2019) Paper 4.3, 17 pp","DOI":"10.37236\/8730"},{"key":"3030_CR10","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.2298\/FIL1712925C","volume":"31","author":"Y Caro","year":"2017","unstructured":"Caro, Y., Hansberg, A.: Partial domination\u2013the isolation number of a graph. Filomat 31, 3925\u20133944 (2017)","journal-title":"Filomat"},{"key":"3030_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.dam.2023.04.007","volume":"336","author":"A Gray","year":"2023","unstructured":"Gray, A., Henning, M.A.: Paired-domination game played on cycles. Discrete Appl. Math. 336, 132\u2013140 (2023)","journal-title":"Discrete Appl. Math."},{"key":"3030_CR12","first-page":"79","volume":"4","author":"TW Haynes","year":"2019","unstructured":"Haynes, T.W., Henning, M.A.: Paired-Domination Game Played in Graphs, Commun. Comb. Optim. 4, 79\u201394 (2019)","journal-title":"Comb. Optim."},{"key":"3030_CR13","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."},{"issue":"4","key":"3030_CR14","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. Discret. Math. 27(4), 2090\u20132107 (2013)","journal-title":"SIAM J. Discret. Math."},{"key":"3030_CR15","doi-asserted-by":"crossref","unstructured":"Lema\u0144ska, M., Mora, M., Souto-Salorio, M.J.: Graphs with isolation number equal to one third of the order, Discrete Math. 347 (2024) Paper No. 113903, 10 pp","DOI":"10.1016\/j.disc.2024.113903"},{"key":"3030_CR16","first-page":"37","volume":"41","author":"JB Phillips","year":"2001","unstructured":"Phillips, J.B., Slater, P.J.: An introduction to graph competition independence and enclaveless parameters. Graph Theory Notes N. Y. 41, 37\u201341 (2001)","journal-title":"Graph Theory Notes N. Y."},{"key":"3030_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, G., Wu, B.: Cycle isolation of graphs with small girth, Graphs Combin. 40 (2024) Paper No. 38, 19 pp","DOI":"10.1007\/s00373-024-02768-7"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03030-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03030-y","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03030-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:17:28Z","timestamp":1775715448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03030-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,3]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3030"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03030-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,3]]},"assertion":[{"value":"22 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no relevant competing financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"30"}}