“…[8] proved that planar cubic graphs are good. Recently in [2] the authors proved that claw-free subcubic graphs and 4-chordal subcubic graphs have the same property. In this paper, we are interested in finding a good decomposition of claw-free cubic graphs.…”
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.
“…[8] proved that planar cubic graphs are good. Recently in [2] the authors proved that claw-free subcubic graphs and 4-chordal subcubic graphs have the same property. In this paper, we are interested in finding a good decomposition of claw-free cubic graphs.…”
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.