Indexed by：
Abstract：
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We prove that this conjecture is true for connected cubic graphs with a 2-factor consisting of three cycles. (C) 2020 Elsevier B.V. All rights reserved.
Keyword：
Reprint 's Address：
Email：
Version：
Source ：
DISCRETE MATHEMATICS
ISSN： 0012-365X
Year： 2020
Issue： 6
Volume： 343
0 . 8 7
JCR@2020
0 . 7 0 0
JCR@2023
ESI Discipline： MATHEMATICS;
ESI HC Threshold：50
JCR Journal Grade：3
CAS Journal Grade：3
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 0
Affiliated Colleges：
