OpenAlex
Decompositions of cubic traceable graphs
Work
Year: 2018
Type: article
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 pro... more
Cites: 15
Cited by: 8
Related to: 10
FWCI: 0.692
Citation percentile (by year/subfield): 91.73
Open Access status: diamond