Decomposing Claw-free Subcubic Graphs and 4-Chordal Subcubic Graphs

2018/06/28 by Aboomahigir, Elham, Ahanjideh, Milad, Akbari, Saieed
#05C70 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1806.11009

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.

Related

• Hoffmann-Ostenhof's conjecture for claw-free cubic graphs
• Hoffmann-Ostenhof's conjecture for traceable cubic graphs
• Decomposing planar cubic graphs
• Reductions for the 3-Decomposition Conjecture
• Decomposing cubic graphs into isomorphic linear forests