{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T22:25:53Z","timestamp":1783463153971,"version":"3.55.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T00:00:00Z","timestamp":1778457600000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00373-026-03045-5","type":"journal-article","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:29:54Z","timestamp":1778495394000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Zero Forcing on 2-connected Outerplanar Graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Nolan","family":"Ison","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5963-0056","authenticated-orcid":false,"given":"Mark","family":"Kempton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franklin","family":"Kenter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,11]]},"reference":[{"key":"3045_CR1","first-page":"65","volume":"57","author":"S Butler","year":"2013","unstructured":"Butler, S., Young, M.: Throttling zero forcing propagation speed on graphs. Australasian Journal of Combinatorics 57, 65\u201371 (2013)","journal-title":"Australasian Journal of Combinatorics"},{"issue":"4","key":"3045_CR2","first-page":"433","volume":"3","author":"G Chartrand","year":"1967","unstructured":"Chartrand, G., Harary, F.: Planar permutation graphs. Annales de l\u2019I.H.P. Probabilit\u00e9s et statistiques 3(4), 433\u2013438 (1967)","journal-title":"Annales de l\u2019I.H.P. Probabilit\u00e9s et statistiques"},{"issue":"1","key":"3045_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0095-8956(90)90093-F","volume":"50","author":"Yves Colin de Verdi\u00e8re","year":"1990","unstructured":"Yves Colin de Verdi\u00e8re: Sur un nouvel invariant des graphes et un crit\u00e8re de planarit\u00e9. Journal of Combinatorial Theory, Series B 50(1), 11\u201321 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"3045_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.cam.2018.05.055","volume":"354","author":"G Hern\u00e1ndez","year":"2019","unstructured":"Hern\u00e1ndez, G., Ranilla, J., Ranilla-Cortina, S.: Zero forcing in triangulations. J. Comput. Appl. Math. 354, 123\u2013130 (2019)","journal-title":"J. Comput. Appl. Math."},{"key":"3045_CR5","unstructured":"Research, W.: Inc. Mathematica, Version 13.3, (2023)"},{"issue":"2","key":"3045_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF00977745","volume":"10","author":"A Proskurowski","year":"1981","unstructured":"Proskurowski, A., Sys\u0142o, M.M.: Minimum dominating cycles in outerplanar graphs. International Journal of Computer & Information Sciences 10(2), 127\u2013139 (1981)","journal-title":"International Journal of Computer & Information Sciences"},{"issue":"12","key":"3045_CR7","doi-asserted-by":"publisher","first-page":"4423","DOI":"10.1016\/j.laa.2011.05.012","volume":"436","author":"DD Row","year":"2012","unstructured":"Row, D.D.: A technique for computing the zero forcing number of a graph with a cut-vertex. Linear Algebra Appl. 436(12), 4423\u20134432 (2012)","journal-title":"Linear Algebra Appl."},{"key":"3045_CR8","doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank-Special\u00a0Graphs Work et\u00a0al. Zero forcing sets and the minimum rank of graphs. Linear Algebra and its Applications, 428(7):1628\u20131648, (2008)","DOI":"10.1016\/j.laa.2007.10.009"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03045-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03045-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03045-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T14:26:13Z","timestamp":1781274373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03045-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,11]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["3045"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03045-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,11]]},"assertion":[{"value":"30 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"51"}}