{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:09Z","timestamp":1758586209963,"version":"3.44.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_25","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:32Z","timestamp":1758498332000},"page":"336-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear Time Algorithms for\u00a0Colorful 3-Rainbow Domination in\u00a0Block and\u00a0Cactus Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-1542-683X","authenticated-orcid":false,"given":"Tetiana","family":"Lavynska","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","unstructured":"Ahangar, H.A., Amjadi, J., Rad, N.J., Samodivkin, V.: Total k-rainbow domination numbers in graphs. Commun. Comb. Optim 3(1), 37\u201350 (2018). https:\/\/doi.org\/10.22049\/cco.2018.25719.1021","DOI":"10.22049\/cco.2018.25719.1021"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Bre\u0161ar, B., Henning, M.A., Rall, D.F.: Rainbow domination in graphs. Taiwanese J. Math. 12(1), 213\u2013225 (2008). https:\/\/doi.org\/10.11650\/twjm\/1500602498","DOI":"10.11650\/twjm\/1500602498"},{"issue":"17","key":"25_CR3","doi-asserted-by":"publisher","first-page":"2394","DOI":"10.1016\/J.DAM.2007.07.018","volume":"155","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar, B., \u0160umenjak, T.K.: On the 2-rainbow domination in graphs. Discret. Appl. Math. 155(17), 2394\u20132400 (2007). https:\/\/doi.org\/10.1016\/J.DAM.2007.07.018","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/J.DAM.2009.08.010","volume":"158","author":"GJ Chang","year":"2010","unstructured":"Chang, G.J., Wu, J., Zhu, X.: Rainbow domination on trees. Discret. Appl. Math. 158(1), 8\u201312 (2010). https:\/\/doi.org\/10.1016\/J.DAM.2009.08.010","journal-title":"Discret. Appl. Math."},{"key":"25_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, W. H (1979)"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4153\/CMB-1963-001-x","volume":"6","author":"F Harary","year":"1963","unstructured":"Harary, F.: A characterization of block-graphs. Can. Math. Bull. 6(1), 1\u20136 (1963). https:\/\/doi.org\/10.4153\/CMB-1963-001-x","journal-title":"Can. Math. Bull."},{"issue":"4","key":"25_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1073\/pnas.39.4.315","volume":"39","author":"F Harary","year":"1953","unstructured":"Harary, F., Uhlenbeck, G.E.: On the number of Husimi trees: I. PNAS 39(4), 315\u2013322 (1953). https:\/\/doi.org\/10.1073\/pnas.39.4.315","journal-title":"PNAS"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Lavynska, T.: Colorful 3-rainbow domination. In: SOFSEM 2025, LNCS, vol. 15539, pp. 99\u2013111. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-82697-9_8","DOI":"10.1007\/978-3-031-82697-9_8"},{"issue":"2","key":"25_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s40840-017-0488-6","volume":"42","author":"Z Shao","year":"2017","unstructured":"Shao, Z., Li, Z., Peperko, A., Wan, J., \u017derovnik, J.: Independent rainbow domination of graphs. Bullet. Malays. Math. Sci. Soc. 42(2), 417\u2013435 (2017). https:\/\/doi.org\/10.1007\/s40840-017-0488-6","journal-title":"Bullet. Malays. Math. Sci. Soc."},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1008293.1008294","volume":"5","author":"LJ Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J.: Planar 3-colorability is polynomial complete. SIGACT News 5(3), 19\u201325 (1973). https:\/\/doi.org\/10.1145\/1008293.1008294","journal-title":"SIGACT News"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Tarjan, R.E., Vishkin, U.: Finding biconnected components and computing tree functions in logarithmic parallel time. In: FOCS 1984, pp. 12\u201320. IEEE (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715896","DOI":"10.1109\/SFCS.1984.715896"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.7151\/DMGT.2256","volume":"41","author":"A Tepeh","year":"2021","unstructured":"Tepeh, A.: Total domination in generalized prisms and a new domination invariant. Discuss. Math. Graph Theory 41(4), 1165\u20131178 (2021). https:\/\/doi.org\/10.7151\/DMGT.2256","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:33Z","timestamp":1758498333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}