10 citations · 14 across the 2 of their papers we have counts for
1 paper · 1 filter
David Amos, Yair Caro, Randy Davila +1
Given a simple undirected graph G and a positive integer k, the k-forcing number of G, denoted Fk(G), is the minimum number of vertices that need to be initially colored…