Degree sums and path-factors in graphs

CSpace

	Degree sums and path-factors in graphs
	Chen, YJ ; Tian, F ; Wei, B
	2001
发表期刊	GRAPHS AND COMBINATORICS
ISSN	0911-0119
卷号	17 期号:1 页码:61-71
摘要	Let 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).
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000168577900006
出版者	SPRINGER-VERLAG
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16286
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, YJ
作者单位	1.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
推荐引用方式 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.