Theo-Conjecture for bridgeless cubic graphs

Let $G$ be a bridgeless cubic graph, and let $n(G)$ denote its number of vertices. Assume

$$n(G)\geq 10.$$

Theo-Conjecture.

$$\operatorname{zdmg}(G)=n(G).$$

This predicts full zombie damage for sufficiently large bridgeless cubic graphs. The paper proves full damage for cubic graphs of girth at least five, while short cycles may create competing geodesic moves; the bridgeless case with $n(G)\geq10$ remains open.