P. Li, W. Liu
Decompositions of cubic traceable graphs
Discussiones Mathematicae Graph Theory
Received 06.02.2017, Revised 18.01.2018, Accepted 18.01.2018, doi: 10.7151/dmgt.2132
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.
decomposition, cubic traceable graph, spanning tree, matching, 2-regular graph