On a conjecture of Gentner and Rautenbach
  Gentner and Rautenbach conjectured that the size of a minimum zero forcing set in a connected graph on $n$ vertices with maximum degree $3$ is at most $\frac{1}{3}n+2$. We disprove this conjecture by constructing a collection of connected graphs $\{G_n\}$ with maximum degree 3 of arbitrarily large order having zero forcing number at least $\frac{4}{9}|V(G_n)|$. 
Ant\'onio Gir\~ao, G\'abor M\'esz\'aros, Stephen G. Z. Smith
math.CO