可迹三次图的Hoffmann-Ostenhof猜想
Hoffmann-Ostenhof's conjecture for traceable cubic graphs
摘要：
Hoffmann-Ostenhof证明了连通三次图的边集可以分解为生成树、匹配和圈族。在本文中，我们证明了这个猜想成立的可迹三次图。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
