CSpace
Degree sums and path-factors in graphs
Chen, YJ; Tian, F; Wei, B
2001
Source PublicationGRAPHS AND COMBINATORICS
ISSN0911-0119
Volume17Issue:1Pages:61-71
AbstractLet G be a connected graph of order n and suppose that n = Sigma (k)(i)=l n(i), where n(i) greater than or equal to 2 are integers. In this paper we give some sufficient conditions in terms of degree sums to ensure that G contains a spanning subgraph consisting of vertex disjoint paths of orders n1, n2,..., n(k).
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000168577900006
PublisherSPRINGER-VERLAG
Citation statistics
Cited Times:8[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/16286
Collection中国科学院数学与系统科学研究院
Affiliation1.Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Chen, YJ,Tian, F,Wei, B. Degree sums and path-factors in graphs[J]. GRAPHS AND COMBINATORICS,2001,17(1):61-71.
APA Chen, YJ,Tian, F,&Wei, B.(2001).Degree sums and path-factors in graphs.GRAPHS AND COMBINATORICS,17(1),61-71.
MLA Chen, YJ,et al."Degree sums and path-factors in graphs".GRAPHS AND COMBINATORICS 17.1(2001):61-71.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chen, YJ]'s Articles
[Tian, F]'s Articles
[Wei, B]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chen, YJ]'s Articles
[Tian, F]'s Articles
[Wei, B]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chen, YJ]'s Articles
[Tian, F]'s Articles
[Wei, B]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.