Hoffmann-Ostenhof's conjecture for claw-free cubic graphs
Abstract
Hoffmann-Ostenhof's Conjecture states that 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.