Hoffmann-Ostenhof's conjecture for traceable cubic graphs
classification
🧮 math.CO
cs.DM
keywords
cubicconjecturegraphshoffmann-ostenhoftraceableconjecturedconnectedcycles
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.