{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T23:14:04Z","timestamp":1770333244886,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s40314-023-02500-w","type":"journal-article","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T18:01:38Z","timestamp":1700676098000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computation of Grundy dominating sequences in (co-)bipartite graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arti","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopika","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,22]]},"reference":[{"key":"2500_CR1","doi-asserted-by":"crossref","unstructured":"Bell K, Driscoll K, Krop E et\u00a0al (2021) Grundy domination of forests and the strong product conjecture. Electron J Comb P2\u201312","DOI":"10.37236\/9507"},{"issue":"3","key":"2500_CR2","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 DF (2010) Domination game and an imagination strategy. SIAM J Discrete Math 24(3):979\u2013991","journal-title":"SIAM J Discrete Math"},{"key":"2500_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.disc.2014.07.016","volume":"336","author":"B Bre\u0161ar","year":"2014","unstructured":"Bre\u0161ar B, Gologranc T, Milani\u010d M et al (2014) Dominating sequences in graphs. Discrete Math 336:22\u201336","journal-title":"Discrete Math"},{"key":"2500_CR4","doi-asserted-by":"crossref","unstructured":"Bre\u0161ar B, Gologranc T, Kos T (2016a) Dominating sequences under atomic changes with applications in Sierpinski and interval graphs. Appl Anal Discrete Math 10(2):518\u2013531","DOI":"10.2298\/AADM161005024B"},{"key":"2500_CR5","doi-asserted-by":"crossref","unstructured":"Bre\u0161ar B, Henning MA, Rall DF (2016b) Total dominating sequences in graphs. Discrete Math 339(6):1665\u20131676","DOI":"10.1016\/j.disc.2016.01.017"},{"key":"2500_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.disopt.2017.07.001","volume":"26","author":"B Bre\u0161ar","year":"2017","unstructured":"Bre\u0161ar B, Bujt\u00e1s C, Gologranc T et al (2017) Grundy dominating sequences and zero forcing sets. Discrete Optim 26:66\u201377","journal-title":"Discrete Optim"},{"key":"2500_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-69087-8","volume-title":"Domination games played on graphs","author":"B Bre\u0161ar","year":"2021","unstructured":"Bre\u0161ar B, Henning MA, Klav\u017ear S et al (2021) Domination games played on graphs. Springer, Berlin"},{"key":"2500_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.dam.2021.05.025","volume":"301","author":"M Camp\u00ealo","year":"2021","unstructured":"Camp\u00ealo M, Sever\u00edn D (2021) An integer programming approach for solving a generalized version of the Grundy domination number. Discrete Appl Math 301:26\u201348","journal-title":"Discrete Appl Math"},{"issue":"6","key":"2500_CR9","doi-asserted-by":"publisher","first-page":"1819","DOI":"10.1007\/s00373-020-02221-5","volume":"36","author":"A Erey","year":"2020","unstructured":"Erey A (2020) Uniform length dominating sequence graphs. Graphs Comb 36(6):1819\u20131825","journal-title":"Graphs Comb"},{"key":"2500_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.47443\/dml.2021.s103","volume":"6","author":"T Haynes","year":"2021","unstructured":"Haynes T, Hedetniemi S (2021) Vertex sequences in graphs. Discrete Math Lett 6:19\u201331","journal-title":"Discrete Math Lett"},{"key":"2500_CR11","volume-title":"Topics in domination in graphs, developments in mathematics","year":"2020","unstructured":"Haynes TW, Hedetniemi ST, Henning MA (eds) (2020) Topics in domination in graphs, developments in mathematics, vol 64. Springer, Cham"},{"key":"2500_CR12","volume-title":"Structures of domination in graphs, developments in mathematics","year":"2021","unstructured":"Haynes TW, Hedetniemi ST, Henning MA (eds) (2021) Structures of domination in graphs, developments in mathematics, vol 66. Springer, Cham"},{"key":"2500_CR13","volume-title":"Domination in graphs: core concepts. Manuscript","author":"TW Haynes","year":"2022","unstructured":"Haynes TW, Hedetniemi ST, Henning MA (2022) Domination in graphs: core concepts. Manuscript. Springer, New York"},{"issue":"1\u20132","key":"2500_CR14","first-page":"87","volume":"14","author":"P Heggernes","year":"2007","unstructured":"Heggernes P, Kratsch D (2007) Linear-time certifying recognition algorithms and forbidden induced subgraphs. Nord J Comput 14(1\u20132):87\u2013108","journal-title":"Nord J Comput"},{"key":"2500_CR15","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.laa.2018.11.003","volume":"563","author":"JH Lin","year":"2019","unstructured":"Lin JH (2019) Grundy domination number, and their variants. Linear Algebra Appl 563:240\u2013254","journal-title":"Linear Algebra Appl"},{"key":"2500_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.dam.2020.03.016","volume":"284","author":"G Nasini","year":"2020","unstructured":"Nasini G, Torres P (2020) Grundy dominating sequences on x-join product. Discrete Appl Math 284:138\u2013149","journal-title":"Discrete Appl Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02500-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02500-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02500-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T11:03:34Z","timestamp":1702033414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02500-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,22]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["2500"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02500-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,22]]},"assertion":[{"value":"24 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"359"}}