Hoffmann-Ostenhof's conjecture for traceable cubic graphs

Abstract

It was conjectured by Hoffmann-Ostenhof that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. In this paper, we show that this conjecture holds for traceable cubic graphs.

Cited by in corpus (2)

• Towards obtaining a 3-Decomposition from a perfect Matching
• Hoffmann-Ostenhof's conjecture for claw-free cubic graphs