Hoffmann-Ostenhof's conjecture for claw-free cubic graphs

Abstract

Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a 2-regular subgraph. In this paper, we show that the conjecture holds for claw-free cubic graphs.