Fulkersonʼs Conjecture and Loupekine snarks

Fulkersonʼs Conjecture says that every bridgeless cubic graph has six perfect matchings such that each edge belongs to exactly two of them. In 1976, F. Loupekine created a method for constructing new snarks from already known ones. We consider an infinite family of snarks built with Loupekineʼs method, and verify Fulkersonʼs Conjecture for this family.