Let G be a connected graph of order n and suppose that n=∑i=1kni, where ni≥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,…,nk.
机构:
Jiangsu Univ Sci & Technol, Sch Sci, Zhenjiang 212100, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Sci, Zhenjiang 212100, Jiangsu, Peoples R China
Zhou, Sizhong
Sun, Zhiren
论文数: 0引用数: 0
h-index: 0
机构:
Nanjing Normal Univ, Sch Math Sci, Nanjing 210023, Jiangsu, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Sci, Zhenjiang 212100, Jiangsu, Peoples R China
Sun, Zhiren
Liu, Hongxia
论文数: 0引用数: 0
h-index: 0
机构:
Yantai Univ, Sch Math & Informat Sci, Yantai 264005, Shandong, Peoples R ChinaJiangsu Univ Sci & Technol, Sch Sci, Zhenjiang 212100, Jiangsu, Peoples R China