Decomposition of cubic graphs with a 2-factor consisting of three cycles - Details

author：

Xie, M. (Xie, M..) ^[1] | Zhou, C. (Zhou, C..) ^[2] | Zhou, S. (Zhou, S..) ^[3]

Indexed by：

Scopus

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.　©　2020　Elsevier　B.V.

Keyword：

2-factor; Cubic graphs; Decomposition; Spanning tree

Community：

[ 1 ] [Xie, M.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 2 ] [Zhou, C.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 3 ] [Zhou, S.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China

Reprint 's Address：

[Zhou, C.]Center for Discrete Mathematics, Fuzhou UniversityChina

Email：

cxzhou@fzu.edu.cn

Show more details

Related Keywords：

Source ：

Discrete Mathematics

ISSN： 0012-365X

Year： 2020

Issue： 6

Volume： 343

0 . 8 7

JCR@2020

0 . 7 0 0

JCR@2023

ESI HC Threshold：50

JCR Journal Grade：3

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 2

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 0

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to