Upper bounds on the k-forcing number of a graph

David Amos, Yair Caro, Randy Davila, Ryan Pepper. Upper bounds on the k-forcing number of a graph. Discrete Applied Mathematics, 181:1-10, 2015. [doi]

@article{AmosCDP15,
  title = {Upper bounds on the k-forcing number of a graph},
  author = {David Amos and Yair Caro and Randy Davila and Ryan Pepper},
  year = {2015},
  doi = {10.1016/j.dam.2014.08.029},
  url = {http://dx.doi.org/10.1016/j.dam.2014.08.029},
  researchr = {https://researchr.org/publication/AmosCDP15},
  cites = {0},
  citedby = {0},
  journal = {Discrete Applied Mathematics},
  volume = {181},
  pages = {1-10},
}