Decompositions of Cubic Traceable Graphs

Abstract

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.

Keywords

• decomposition
• cubic traceable graph
• spanning tree
• matching
• 2-regular graph
• 05c70
• 05c75