Claw-free cubic graphs and zero forcing

Jorge Lozano, Shahla Nasserasr, Thomas Wall

A claw-free cubic graph is a cubic graph with no induced subgraph isomorphic to $K_{1,3}$. The zero forcing process begins with an initial set $S$ of colored vertices. At each step…