"Upper bounds on the k-forcing number of a graph."

David Amos et al. (2015)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2014.08.029

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/AmosCDP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AmosCDP15
David Amos, Yair Caro, Randy Davila, Ryan Pepper:
Upper bounds on the k-forcing number of a graph. Discret. Appl. Math. 181: 1-10 (2015)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.