Hoffmann-Ostenhof's conjecture for traceable cubic graphs
Combinatorics
2016-07-19 v1 Discrete Mathematics
Abstract
It was conjectured by Hoffmann-Ostenhof that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. In this paper, we show that this conjecture holds for traceable cubic graphs.
Keywords
Cite
@article{arxiv.1607.04768,
title = {Hoffmann-Ostenhof's conjecture for traceable cubic graphs},
author = {F. Abdolhosseini and S. Akbari and H. Hashemi and M. S. Moradian},
journal= {arXiv preprint arXiv:1607.04768},
year = {2016}
}