{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:33:30Z","timestamp":1757313210595},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1934-4","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T02:15:22Z","timestamp":1534731322000},"page":"1371-1384","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Total Forcing and Zero Forcing in Claw-Free Cubic Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Randy","family":"Davila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Henning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,20]]},"reference":[{"key":"1934_CR1","doi-asserted-by":"crossref","unstructured":"AIM Special Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl 428(7), 1628\u20131648 (2008)","DOI":"10.1016\/j.laa.2007.10.009"},{"issue":"2","key":"1934_CR2","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, T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72(2), 146\u2013177 (2013)","journal-title":"J. Graph Theory"},{"key":"1934_CR3","series-title":"Automata, Languages and Programming","first-page":"254","volume-title":"A Graph Reduction Step Preserving Element-Connectivity and Applications","author":"C Chekuri","year":"2009","unstructured":"Chekuri, C., Korula, N.: A Graph Reduction Step Preserving Element-Connectivity and Applications. Automata, Languages and Programming, pp. 254\u2013265. Springer, New York (2009)"},{"issue":"6","key":"1934_CR4","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1016\/j.jctb.2008.03.002","volume":"98","author":"M Chudnovsky","year":"2008","unstructured":"Chudnovsky, M., Seymour, P.: Claw-free graphs. V. Global structure. J. Combin. Theory Ser. B 98(6), 1373\u20131410 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1934_CR5","unstructured":"Davila, R.: Bounding the forcing number of a graph. Rice University Masters Thesis (2015)"},{"issue":"2","key":"1934_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.2989\/16073606.2017.1376230","volume":"41","author":"R Davila","year":"2018","unstructured":"Davila, R., Henning, M.A.: The forcing number of graphs with a given girth. Quaest. Math. 41(2), 189\u2013204 (2018)","journal-title":"Quaest. Math."},{"key":"1934_CR7","unstructured":"Davila, R., Henning, M.A.: On the total forcing number of a graph, manuscript"},{"key":"1934_CR8","unstructured":"Davila, R., Henning, M.A.: Total forcing sets and zero forcing sets in trees. To appear in Discuss. Math. Graph Theory"},{"key":"1934_CR9","doi-asserted-by":"crossref","unstructured":"Davila, R., Kenter, F.: Bounds for the zero forcing number of a graph with large girth. Theory Appl. Graph 2(2), Article 1 (2015)","DOI":"10.20429\/tag.2015.020201"},{"key":"1934_CR10","unstructured":"Davila, R., Malinowski, T., Stephen, S.: Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree. Discret. Appl. Math"},{"key":"1934_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2017.01.032","volume":"223","author":"WJ Desormeaux","year":"2017","unstructured":"Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Partitioning the vertices of a cubic graph into two total dominating sets. Discret. Appl. Math. 223, 52\u201363 (2017)","journal-title":"Discret. Appl. Math."},{"key":"1934_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00373-004-0577-9","volume":"20","author":"O Favaron","year":"2004","unstructured":"Favaron, O., Henning, M.A.: Paired domination in claw-free cubic graphs. Graph. Combin. 20, 447\u2013456 (2004)","journal-title":"Graph. Combin."},{"key":"1934_CR13","doi-asserted-by":"publisher","first-page":"3491","DOI":"10.1016\/j.disc.2007.07.007","volume":"308","author":"O Favaron","year":"2008","unstructured":"Favaron, O., Henning, M.A.: Bounds on total domination in claw-free cubic graphs. Discret. Math. 308, 3491\u20133507 (2008)","journal-title":"Discret. Math."},{"key":"1934_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0012-365X(96)00045-3","volume":"164","author":"E Flandrin","year":"1997","unstructured":"Flandrin, E., Faudree, R., Ryj\u00e1\u010dek, Z.: Claw-free graphs\u2014a survey. Discret. Math. 164, 87\u2013147 (1997)","journal-title":"Discret. Math."},{"key":"1934_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.dam.2016.06.004","volume":"214","author":"M Gentner","year":"2016","unstructured":"Gentner, M., Penso, L.D., Rautenbach, D., Souzab, U.S.: Extremal values and bounds for the zero forcing number. Discret. Appl. Math. 214, 196\u2013200 (2016)","journal-title":"Discret. Appl. Math."},{"key":"1934_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.dam.2017.11.015","volume":"236","author":"M Gentner","year":"2018","unstructured":"Gentner, M., Rautenbach, D.: Some bounds on the zero forcing number of a graph. Discret. Appl. Math. 236, 203\u2013213 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"12","key":"1934_CR17","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"C Edholm","year":"2012","unstructured":"Edholm, C., Hogben, L., LaGrange, J., Row, 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)","journal-title":"Linear Algebra Appl."},{"issue":"21","key":"1934_CR18","doi-asserted-by":"publisher","first-page":"3107","DOI":"10.1016\/j.disc.2012.06.024","volume":"312","author":"MA Henning","year":"2012","unstructured":"Henning, M.A., L\u00f6wenstein, C.: Locating-total domination in claw-free cubic graphs. Discret. Math. 312(21), 3107\u20133116 (2012)","journal-title":"Discret. Math."},{"issue":"4","key":"1934_CR19","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1007\/s00026-016-0331-z","volume":"20","author":"MA Henning","year":"2016","unstructured":"Henning, M.A., Marcon, A.J.: Semitotal domination in claw-free cubic graphs. Ann. Combin. 20(4), 799\u2013813 (2016)","journal-title":"Ann. Combin."},{"key":"1934_CR20","unstructured":"Henning, M.A., Yeo, A.: Total domination in graphs (Springer Monographs in Mathematics) 2013. ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6 (Online)"},{"key":"1934_CR21","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2012.04.003","volume":"160","author":"L Hogbena","year":"2012","unstructured":"Hogbena, L., Huynh, M., Kingsley, N., Meyer, S., Walker, S., Young, M.: Propagation time for zero forcing on a graph. Discret. Appl. Math. 160, 1994\u20132005 (2012)","journal-title":"Discret. Appl. Math."},{"key":"1934_CR22","first-page":"7","volume":"51","author":"N Lichiardopol","year":"2011","unstructured":"Lichiardopol, N.: On a conjecture on total domination in claw-free cubic graphs: proof and new upper bound. Aust. J. Combin. 51, 7\u201328 (2011)","journal-title":"Aust. J. Combin."},{"key":"1934_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.dam.2016.05.009","volume":"213","author":"L Lu","year":"2016","unstructured":"Lu, L., Wu, B., Tang, Z.: Proof of a conjecture on the zero forcing number of a graph. Discret. Appl. Math. 213, 233\u2013237 (2016)","journal-title":"Discret. Appl. Math."},{"key":"1934_CR24","doi-asserted-by":"publisher","first-page":"2984","DOI":"10.1016\/j.disc.2010.07.006","volume":"310","author":"J Southey","year":"2010","unstructured":"Southey, J., Henning, M.A.: On a conjecture on total domination in claw-free cubic graphs. Discret. Math. 310, 2984\u20132999 (2010)","journal-title":"Discret. Math."},{"key":"1934_CR25","unstructured":"Trefois, M., Delvenne, J.C.: Zero forcing sets, constrained matchings and minimum rank, mansucript"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1934-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1934-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1934-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:22:54Z","timestamp":1566242574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1934-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1934"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1934-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,20]]},"assertion":[{"value":"8 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}