Skip to main content
Springer Nature Link
Log in

Degree Sums and Path-Factors in Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Let G be a connected graph of order n and suppose that n=∑ i =1 k n i , where n i ≥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 n 1,n 2,…,n k .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Department of Mathematics, Nanjing University, Nanjing 210093, China, , , , , , CN

    Yaojun Chen

  2.  Institute of Systems Science, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing 100080, China, , , , , , CN

    Feng Tian & Bing Wei

Authors
  1. Yaojun Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Feng Tian
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Bing Wei
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: June 30, 1999 Final version received: July 31, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Y., Tian, F. & Wei, B. Degree Sums and Path-Factors in Graphs. Graphs Comb 17, 61–71 (2001). https://doi.org/10.1007/PL00007239

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007239

Keywords