Hoffmann-Ostenhof's conjecture for claw-free cubic graphs

2018/09/28 by Milad Ahanjideh, Ahanjideh, Milad, Elham Aboomahigir +1 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1810.00074

openalex publication_date 2018/09/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Hoffmann-Ostenhof's conjecture for traceable cubic graphs

Cited by

• Finding a HIST: Chordality, Structural Parameters, and Diameter

Related

• Decomposing Claw-free Subcubic Graphs and 4-Chordal Subcubic Graphs
• Hoffmann-Ostenhof's conjecture for traceable cubic graphs
• Decomposing planar cubic graphs
• On 2-bisections and monochromatic edges in claw-free cubic multigraphs
• Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable