Decompositions of Cubic Traceable Graphs
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.
Main Authors: | Liu Wenzhong, Li Panpan |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2020-02-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2132 |
Similar Items
-
On the Minimum Number of Spanning Trees in Cubic Multigraphs
by: Bogdanowicz Zbigniew R.
Published: (2020-02-01) -
The Spectrum Problem for the Connected Cubic Graphs of Order 10
by: Adams Peter, et al.
Published: (2021-11-01) -
On Hamiltonian Cycles in Claw-Free Cubic Graphs
by: Mohr Elena, et al.
Published: (2022-02-01) -
Turán Function and H-Decomposition Problem for Gem Graphs
by: Liu Henry, et al.
Published: (2018-08-01) -
Decomposition of Certain Complete Bipartite Graphs into Prisms
by: Froncek Dalibor
Published: (2017-02-01)