Matching, path covers, and total forcing sets

References

• AIM Special Work Group, Zero forcing sets and the minimum rank of graphs, Linear Algebra Appl. 428(7) (2008), 1628–1648. doi: 10.1016/j.laa.2007.10.009
   Web of Science ®Google Scholar
• D. Amos, Y. Caro, R. Davila, and R. Pepper, Upper bounds on the k-forcing number of a graph, Discrete Applied Math. 181 (2015), 1–10. doi: 10.1016/j.dam.2014.08.029
   Web of Science ®Google Scholar
• F. Barioli, W. Barrett, S.M. Fallat, T. Hall, L. Hogben, B. Shader, P. van den Driessche, and H. van der Holst, Parameters related to tree-width, zero forcing, and maximum nullity of a graph, J. Graph Theory 72(2) (2013), 146–177. doi: 10.1002/jgt.21637
   Web of Science ®Google Scholar
• B. Brimkov and I.V. Hicks, Complexity and computation of connected zero forcing, Discrete Appl. Math. 229 (2017), 31–45. doi: 10.1016/j.dam.2017.05.016
   Web of Science ®Google Scholar
• R. Davila, Bounding the forcing number of a graph, Rice University Masters Thesis, 2015. https://scholarship.rice.edu/handle/1911/87761.
   Google Scholar
• R. Davila and M.A. Henning, The forcing number of graphs with given girth, Questiones Mathematicae 41(2) (2018), 189–204. doi: 10.2989/16073606.2017.1376230
   Web of Science ®Google Scholar
• R. Davila and M.A. Henning, Total forcing sets and zero forcing sets in trees, Discuss. Math. Graph Theory, to appear.
   Google Scholar
• R. Davila and M.A. Henning, Total forcing and zero forcing in claw-free cubic graphs, Graphs Combin., to appear.
   Google Scholar
• R. Davila and M.A. Henning, On the total forcing number of a graph, Discrete Applied Math., to appear.
   Google Scholar
• R. Davila and M.A. Henning, Bounds on the connected forcing number of a graph, Graphs Combin., to appear.
   Google Scholar
• R. Davila and F. Kenter, Bounds for the zero forcing number of a graph with large girth, Theory and Applications of Graphs 2(2) (2015), Article 1, 1–8. doi: 10.20429/tag.2015.020201
   Google Scholar
• R. Davila, T. Malinowski, and S. Stephen, Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree, Discrete Applied Math., to appear.
   Google Scholar
• E. DeLaViña, Q. Liu, R. Pepper, B. Waller, and D. B. West, Some conjectures of Graffiti.pc on total domination, Congressus Numer. 185 (2007), 81–95.
   Google Scholar
• C. Edholm, L. Hogben, J. LaGrange, and D. Row, Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph, Linear Algebra Appl. 436(12) (2012), 4352–4372. doi: 10.1016/j.laa.2010.10.015
   Web of Science ®Google Scholar
• M. Gentner, L.D. Penso, D. Rautenbach, and U.S. Souzab, Extremal values and bounds for the zero forcing number, Discrete Applied Math. 214 (2016), 196–200. doi: 10.1016/j.dam.2016.06.004
   Web of Science ®Google Scholar
• M. Gentner and D. Rautenbach, Some bounds on the zero forcing number of a graph, mansucript, Discrete Applied Math. 236 (2018), 203–213. doi: 10.1016/j.dam.2017.11.015
   Web of Science ®Google Scholar
• M.A. Henning and K. Wash, Matchings, path covers and domination, Discrete Math. 340 (2017), 3207–3216. doi: 10.1016/j.disc.2016.07.020
   Web of Science ®Google Scholar
• M.A. Henning and A. Yeo, Total domination in graphs, (Springer Monographs in Mathematics), ISBN-13: 978-1461465249, 2013.
   Google Scholar
• L. Hogben, Minimum rank problems, Linear Algebra Appl. 432 (2010), 1961–1974. doi: 10.1016/j.laa.2009.05.003
   Web of Science ®Google Scholar
• L. Hogben, M. Huynh, N. Kingsley, S. Meyer, S. Walker, and M. Young, Propagation time for zero forcing on a graph, Discrete Applied Math. 160 (2012), 1994–2005. doi: 10.1016/j.dam.2012.04.003
   Web of Science ®Google Scholar
• L. Lovász and M.D. Plummer, Matching Theory, North-Holland Mathematics Studies, Vol. 121; Ann. Discrete Math., Vol. 29, North-Holland, Amsterdam, 1986.
   Google Scholar
• L. Lu, B. Wu, and Z. Tang, Note: Proof of a conjecture on the zero forcing number of a graph, Discrete Applied Math. 213 (2016), 233–237. doi: 10.1016/j.dam.2016.05.009
   Web of Science ®Google Scholar
• M. Plummer, Factors and Factorization, Handbook of Graph Theory J.L. Gross and J. Yellen, eds., pp. 403–430, CRC Press, Boca Raton, Florida, 2004, ISBN 1-58488- 090-2.
   Google Scholar
• W.R. Pulleyblank, Matchings and Extension, Handbook of Combinatorics, R.L. Graham, M. Grötschel, L. Lovász, eds., pp. 179–232, Elsevier Science B.V., Amsterdam, 1995, ISBN 0-444-82346-8.
   Google Scholar