Hits:

Affiliation of Author(s):理学院

Title of Paper:DECOMPOSITIONS OF CUBIC TRACEABLE GRAPHS

Journal:DISCUSSIONES MATHEMATICAE GRAPH THEORY

Key Words:decomposition cubic traceable graph spanning tree matching 2-regular graph

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.

ISSN No.:1234-3099

Translation or Not:no

Date of Publication:2020-01-01

Co-author:Li, Panpan

Correspondence Author:Wenzhong Liu