Small cycle covers of 3-connected cubic graphs

Let G be a 3-connected simple cubic graph on n ≥ 8 vertices. It is proved in this paper that G admits a cycle cover of size at most ⌈ n / 6 ⌉ if and only if G is not one of the five specified graphs.