Hoffmann-Ostenhof's conjecture for traceable cubic graphs

Autor:	Abdolhosseini, F., Akbari, S., Hashemi, H., Moradian, M. S.
Rok vydání:	2016
Předmět:	Mathematics - Combinatorics Computer Science - Discrete Mathematics 05C45 05C70 (Primary)
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1607.04768 Zobrazit plný text záznamu View this record from Arxiv