Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs

From MaRDI portal
Publication:2663993




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 subcubic graphs and 4-chordal subcubic graphs.









This page was built for publication: Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663993)