Consider simple bridgeless cubic planar graphs.

• Does each such graph admit a 2-factorization with $\leq 2$ components each of which has even order?

• If not, does anyone know of an counterexample?

• More generally: each simple bridgeless cubic planar graph is either Hamiltonian or admits a 2-factorization each of which component has even order. But is there an upper bound of the number of these components?