点击次数：

所属单位：理学院

发表刊物：DISCUSSIONES MATHEMATICAE GRAPH THEORY

关键字：decomposition cubic traceable graph spanning tree matching 2-regular graph

摘要：A traceable graph is a graph with a Hamilton path. The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular graph and a matching. We prove the conjecture for cubic traceable graphs.

ISSN号：1234-3099

是否译文：否

发表时间：2020-01-01

合写作者：Li, Panpan

通讯作者：刘文忠