Decomposing Claw-free Subcubic Graphs and $4$-Chordal Subcubic Graphs
Combinatorics
2020-02-03 v2
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 -regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic graphs and -chordal subcubic graphs.
Keywords
Cite
@article{arxiv.1806.11009,
title = {Decomposing Claw-free Subcubic Graphs and $4$-Chordal Subcubic Graphs},
author = {Elham Aboomahigir and Milad Ahanjideh and Saieed Akbari},
journal= {arXiv preprint arXiv:1806.11009},
year = {2020}
}
Comments
6 pages, 3 figures