{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:28Z","timestamp":1740107128667,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"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":[[2024,12]]},"DOI":"10.1007\/s00373-024-02827-z","type":"journal-article","created":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T10:25:13Z","timestamp":1732098313000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Well-Forced Graphs"],"prefix":"10.1007","volume":"40","author":[{"given":"Cheryl","family":"Grood","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9253-6694","authenticated-orcid":false,"given":"Ruth","family":"Haas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9187-5958","authenticated-orcid":false,"given":"Bonnie C.","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3586-6850","authenticated-orcid":false,"given":"Erika L. C.","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7093-0479","authenticated-orcid":false,"given":"Shahla","family":"Nasserasr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"issue":"1","key":"2827_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00373-020-02235-z","volume":"37","author":"SE Anderson","year":"2021","unstructured":"Anderson, S.E., Kuenzel, K., Rall, D.F.: On well-dominated graphs. Graphs Comb. 37(1), 151\u2013165 (2021). https:\/\/doi.org\/10.1007\/s00373-020-02235-z","journal-title":"Graphs Comb."},{"issue":"2","key":"2827_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)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"2827_CR3","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s00373-023-02677-1","volume":"39","author":"NH Bong","year":"2023","unstructured":"Bong, N.H., Carlson, J., Curtis, B., Haas, R., Hogben, L.: Isomorphisms and properties of TAR graphs for zero forcing and other $${X}$$-set parameters. Graphs Comb. 39(4), 86 (2023)","journal-title":"Graphs Comb."},{"key":"2827_CR4","doi-asserted-by":"publisher","unstructured":"Brimkov, B., Carlson, J.: Minimal zero forcing sets. arXiv 428 (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.01810","DOI":"10.48550\/arXiv.2204.01810"},{"key":"2827_CR5","unstructured":"Chartrand, G., Zhang, P.: A First Course in Graph Theory. Cambridge Tracts in Mathematics. Courier Corporation (2012)"},{"issue":"2\u20133","key":"2827_CR6","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1016\/j.laa.2007.05.036","volume":"426","author":"SM Fallat","year":"2007","unstructured":"Fallat, S.M., Hogben, L.: The minimum rank of symmetric matrices described by a graph: a survey. Linear Algebra Appl. 426(2\u20133), 558\u2013582 (2007)","journal-title":"Linear Algebra Appl."},{"key":"2827_CR7","unstructured":"Finbow, A.S., Hartnell, B.L., Nowakowski, R.: Well-dominated graphs: a collection of well-covered ones, pp. 5\u201310 (1988). Eleventh British Combinatorial Conference (London, 1987)"},{"key":"2827_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.dam.2022.06.041","volume":"321","author":"AS Finbow","year":"2022","unstructured":"Finbow, A.S., Hartnell, B.L., Plummer, M.D.: A characterization of well-indumatchable graphs having girth greater than seven. Discrete Appl. Math. 321, 261\u2013271 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.06.041","journal-title":"Discrete Appl. Math."},{"key":"2827_CR9","doi-asserted-by":"publisher","unstructured":"Group, A.M.R.S.G.W.: 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","DOI":"10.1016\/j.laa.2007.10.009"},{"key":"2827_CR10","first-page":"107","volume":"29","author":"BL Hartnell","year":"1999","unstructured":"Hartnell, B.L.: Well-covered graphs. J. Comb. Math. Comb. Comput. 29, 107\u2013115 (1999)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2827_CR11","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/270","volume-title":"Inverse Problems and Zero Forcing for Graphs, Mathematical Surveys and Monographs","author":"L Hogben","year":"2022","unstructured":"Hogben, L., Lin, J.C.H., Shader, B.L.: Inverse Problems and Zero Forcing for Graphs, Mathematical Surveys and Monographs. American Mathematical Society, Providence (2022)"},{"issue":"3","key":"2827_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1080\/16073606.1993.9631737","volume":"16","author":"MD Plummer","year":"1993","unstructured":"Plummer, M.D.: Well-covered graphs: a survey. Quaest. Math. 16(3), 253\u2013287 (1993)","journal-title":"Quaest. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02827-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02827-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02827-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T20:07:44Z","timestamp":1733515664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02827-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2827"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02827-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"24 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2024","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 relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"129"}}