Every 2-connected simple cubic graph of order n ≥ 6 has a cycle cover with at most [n/4] cycles. This bound is best possible.
['Hong-Jian Lai', 'Xiangwen Li']
Note: small cycle cover of 2-connected cubic graphs