{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:54Z","timestamp":1740107094538,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T00:00:00Z","timestamp":1592006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T00:00:00Z","timestamp":1592006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1620202"],"award-info":[{"award-number":["DMS-1620202"]}],"id":[{"id":"10.13039\/501100008982","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":[[2020,11]]},"DOI":"10.1007\/s00373-020-02201-9","type":"journal-article","created":{"date-parts":[[2020,6,13]],"date-time":"2020-06-13T20:02:32Z","timestamp":1592078552000},"page":"1855-1868","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-color Forcing in Graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Chassidy","family":"Bozeman","sequence":"first","affiliation":[]},{"given":"Pamela E.","family":"Harris","sequence":"additional","affiliation":[]},{"given":"Neel","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Young","sequence":"additional","affiliation":[]},{"given":"Teresa","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,13]]},"reference":[{"issue":"7","key":"2201_CR1","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1016\/j.laa.2007.10.009","volume":"428","author":"AIM Minimum Rank-Special Graphs Work Group","year":"2008","unstructured":"AIM Minimum Rank-Special Graphs Work Group.: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628\u20131648 (2008). https:\/\/doi.org\/10.1016\/j.laa.2007.10.009","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2201_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","volume":"433","author":"F Barioli","year":"2010","unstructured":"Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., Shader B., van den Driessche, P., van der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433(2), 401\u2013411 (2010). https:\/\/doi.org\/10.1016\/j.laa.2010.03.008","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"2201_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/jgt.21637","volume":"72","author":"F Barioli","year":"2013","unstructured":"Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der vaHolst, H.: Parameters related to tree-width, zero forcing and maximum nullity of a graph. J. Graph Theory 72(2), 146\u2013177 (2013). https:\/\/doi.org\/10.1002\/jgt.21637","journal-title":"J. Graph Theory"},{"key":"2201_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1103\/PhysRevLett.99.100501","volume":"99","author":"D Burgarth","year":"2007","unstructured":"Burgarth D, Giovannetti, V.: Full control by locally induced relaxation. Phys. Rev. Lett. 99, 10 (2007). https:\/\/doi.org\/10.1103\/PhysRevLett.99.100501","journal-title":"Phys. Rev. Lett."},{"key":"2201_CR5","first-page":"57","volume":"64","author":"KB Chilakamarri","year":"2012","unstructured":"Chilakamarri, K.B., Dean, N., Kang, C.X., Yi, E.: Iteration index of a zero forcing set in a graph. Bull. Inst. Combin Appl. 64, 57\u201372 (2012)","journal-title":"Bull. Inst. Combin Appl."},{"issue":"7","key":"2201_CR6","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.dam.2008.09.012","volume":"157","author":"PA Dreyer Jr","year":"2009","unstructured":"Dreyer Jr., P.A., Robert, F.S.: Irreversible $$k$$-threshold processes: graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl. Math. 157(7), 1615\u20131627 (2009). https:\/\/doi.org\/10.1016\/j.dam.2008.09.012","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"2201_CR7","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"CJ Edholm","year":"2012","unstructured":"Edholm, C.J., Hogben, L., Huynh, M., LaGrange, J., Row, D.D.: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl. 436(12), 4352\u20134372 (2012). https:\/\/doi.org\/10.1016\/j.laa.2010.10.015","journal-title":"Linear Algebra Appl."},{"issue":"13\u201314","key":"2201_CR8","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2012.04.003","volume":"160","author":"L Hogben","year":"2012","unstructured":"Hogben, L., Huynh, M., Kingsley, N., Meyer, S., Walker, S., Young, M.: Propagation time for zero forcing on a graph. Discrete Appl. Math. 160(13\u201314), 1994\u20132005 (2012). https:\/\/doi.org\/10.1016\/j.dam.2012.04.003","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"2201_CR9","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1016\/j.laa.2010.01.001","volume":"432","author":"L-H Huang","year":"2010","unstructured":"Huang, L.-H., Chang, G.J., Yeh, H.-G.: On minimum rank and zero forcing sets of a graph. Linear Algebra Appl. 432(11), 2961\u20132973 (2010). https:\/\/doi.org\/10.1016\/j.laa.2010.01.001","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"2201_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/17M1133051","volume":"33","author":"T Kalinowski","year":"2019","unstructured":"Kalinowski, T., Kam\u010dev, N., Sudakov, B.: The zero forcing number of graphs. SIAM J. Discrete Math. 33(1), 95\u2013115 (2019). https:\/\/doi.org\/10.1137\/17M1133051","journal-title":"SIAM J. Discrete Math."},{"key":"2201_CR11","unstructured":"Misc zero forcing and its applications. American Institute of Mathematics. http:\/\/aimpl.org\/zeroforcing\/1\/"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02201-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02201-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02201-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,12]],"date-time":"2021-06-12T23:22:50Z","timestamp":1623540170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02201-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,13]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["2201"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02201-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,6,13]]},"assertion":[{"value":"4 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}