combinatorics / Graph domination & zero forcing
If $G$ is connected, cubic and diamond-free, must the zero-forcing number satisfy $Z(G) \le \gamma(G) + 2$? A connected cubic triangle-free $14$-vertex graph has $Z = 7$ and $\gamma = 4$.
Temporal state
No reconciled state yet.
Append-only history
If $G$ is connected, cubic and diamond-free, must the zero-forcing number satisfy $Z(G) \le \gamma(G) + 2$? A connected cubic triangle-free $14$-vertex graph has $Z = 7$ and $\gamma = 4$.
Research memory
If $G$ is connected, cubic and diamond-free, must the zero-forcing number satisfy $Z(G) \le \gamma(G) + 2$? A connected cubic triangle-free $14$-vertex graph has $Z = 7$ and $\gamma = 4$.
Evidence graph
No public relationships recorded yet.