The claw-free four-perfect-matching conjecture

A cubic graph is claw-free if it has no induced subgraph isomorphic to $K_{1,3}$. A set of perfect matchings covers a graph when every edge belongs to at least one matching. Claw-free four-perfect-matching conjecture. Every claw-free bridgeless cubic graph can be covered with four perfect matchings.

The paper states that this conjecture is equivalent to the 5-cycle double cover conjecture. Consequently, it remains open.