On a Conjecture of Fan and Raspaud

We show that every bridgeless cubic graph having a 2-factor with at most two odd circuits admits three perfect matchings with no common edge. This partially verifies a conjecture of Fan and Raspaud (1994) and supports Fulkerson's conjecture (1971).