Disconnected 2-Factors in Planar Cubic Bridgeless Graphs

We prove that every planar cubic bridgeless graph with at least six vertices has a disconnected 2-factor, that is a 2-factor which is not a Hamilton cycle. This is in contrast to the fact that there exist arbitrarily large cubic bridgeless graphs in which every 2-factor is a Hamilton cycle.