Hoffmann-Ostenhof's conjecture for claw-free cubic graphs
Combinatorics
2018-10-02 v1
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 -regular subgraph. In this paper, we show that the conjecture holds for claw-free cubic graphs.
Keywords
Cite
@article{arxiv.1810.00074,
title = {Hoffmann-Ostenhof's conjecture for claw-free cubic graphs},
author = {Milad Ahanjideh and Elham Aboomahigir},
journal= {arXiv preprint arXiv:1810.00074},
year = {2018}
}