Skip to main content
SpringerLink
Log in

Connected [a,b]-factors in Graphs

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

In this paper, we prove the following result:

Let G be a connected graph of order n, and minimum degree . Let a and b two integers such that 2a <= b. Suppose and .

Then G has a connected [a,b]-factor.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. URA 410 L.R.I., Bât. 490, Universite Paris-Sud; 91405 Orsay, France; E-mail: km@lri.fr, , , , , , FR

    Mekkia Kouider

  2. URA 410 L.R.I., Bât. 490, Universite Paris-Sud; 91405 Orsay, France; E-mail: maheo@lri.fr, , , , , , FR

    Maryvonne Mahéo

Authors
  1. Mekkia Kouider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maryvonne Mahéo
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 10, 1998/Revised July 31, 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kouider, M., Mahéo, M. Connected [a,b]-factors in Graphs. Combinatorica 22, 71–82 (2002). https://doi.org/10.1007/s004930200004

Download citation

  • Issue Date:

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

Search

Navigation