Decomposing cubic graphs into isomorphic linear forests

In 1987 Wormald conjectured that the edges of every cubic graph on $4n$ vertices can be partitioned into two isomorphic linear forests. We prove this conjecture for large connected cubic graphs. Our proof uses probabilistic ideas and the absorption method.