{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T23:46:10Z","timestamp":1781999170985,"version":"3.54.5"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T00:00:00Z","timestamp":1597190400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T00:00:00Z","timestamp":1597190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s00373-020-02221-5","type":"journal-article","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T13:02:58Z","timestamp":1597237378000},"page":"1819-1825","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Uniform Length Dominating Sequence Graphs"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0628-9322","authenticated-orcid":false,"given":"Aysel","family":"Erey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,12]]},"reference":[{"key":"2221_CR1","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., Klav\u017ear, S., Ko\u0161mrlj, G., Patk\u00f3s, B., Tuza, Z., Vizer, M.: Grundy dominating sequences and zero forcing sets. Discrete Optim. 26, 66\u201377 (2017)","journal-title":"Discrete Optim."},{"key":"2221_CR2","doi-asserted-by":"publisher","unstructured":"Bre\u0161ar, B., Bujt\u00e1s, C., Gologranc, T., Klav\u017ear, S., Ko\u0161mrlj, G., Marc, T., Patk\u00f3s, B., Tuza, Z., Vizer, M.: On Grundy total domination number in product graphs. Discuss. Math. Graph Theory. https:\/\/doi.org\/10.7151\/dmgt.2184 (in press)","DOI":"10.7151\/dmgt.2184"},{"key":"2221_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., Rall, D.F., Rizzi, R.: Dominating sequences in graphs. Discrete Math. 336, 22\u201336 (2014)","journal-title":"Discrete Math."},{"key":"2221_CR4","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1016\/j.disc.2016.01.017","volume":"339","author":"B Bre\u0161ar","year":"2016","unstructured":"Bre\u0161ar, B., Henning, M.A., Rall, D.F.: Total dominating sequences in graphs. Discrete Math. 339, 1665\u20131676 (2016)","journal-title":"Discrete Math."},{"key":"2221_CR5","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":"2221_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.disopt.2017.10.002","volume":"28","author":"B Bre\u0161ar","year":"2018","unstructured":"Bre\u0161ar, B., Kos, T., Nasini, G., Torres, P.: Total dominating sequences in trees, split graphs, and under modular decomposition. Discrete Optim. 28, 16\u201330 (2018)","journal-title":"Discrete Optim."},{"key":"2221_CR7","unstructured":"Gologranc, T., Jakovac, M., Kos, T., Marc, T.: On graphs with equal total domination and Grundy total domination number (2019). arXiv:1906.12235"},{"key":"2221_CR8","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":"2221_CR9","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.dam.2018.09.011","volume":"257","author":"V Ir\u0161i\u010d","year":"2019","unstructured":"Ir\u0161i\u010d, V.: Effect of predomination and vertex removal on the game total domination number of a graph. Discret. Appl. Math. 257, 216\u2013225 (2019)","journal-title":"Discret. Appl. Math."},{"key":"2221_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.dam.2019.03.009","volume":"265","author":"Y Jiang","year":"2019","unstructured":"Jiang, Y., Mei, L.: Game total domination for cyclic bipartite graphs. Discret. Appl. Math. 265, 120\u2013127 (2019)","journal-title":"Discret. Appl. Math."},{"key":"2221_CR11","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."},{"key":"2221_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10878-012-9572-x","volume":"28","author":"G Ko\u0161mrlj","year":"2014","unstructured":"Ko\u0161mrlj, G.: Realizations of the game domination number. J. Comb. Optim. 28, 447\u2013461 (2014)","journal-title":"J. Comb. Optim."},{"key":"2221_CR13","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.laa.2018.11.003","volume":"563","author":"JC-H Lin","year":"2019","unstructured":"Lin, J.C.-H.: Zero forcing number, Grundy domination number, and their variants. Linear Algebra Appl. 563, 240\u2013254 (2019)","journal-title":"Linear Algebra Appl."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02221-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02221-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02221-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T23:30:31Z","timestamp":1628724631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02221-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,12]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["2221"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02221-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,12]]},"assertion":[{"value":"29 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}