Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5

We prove the conjecture made by Bermond, Fouquet, Habib, and Péroche in 1984 that every cubic graph has an edge-coloring as described in the title. The number 5 cannot be replaced by 4.