Skip to main content
SpringerLink
Log in

Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let a, b, be two even integers. In this paper, we get a sufficient condition which involves the stability number, the minimum degree of the graph for the existence of an even [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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akiyama J., Kano M.: Factors and factorizations of graphs, a survey. J. Graph Theory 9, 1–42 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cai J., Liu G., Hou J.: The stability number and connected [k, k + 1]-factor in graphs. Appl. Math. Lett. 22(6), 927–931 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kano M.: An Ore-type sufficient condition for a graph to have a connected [2, k]-factor, (preprint)

  4. Katerinis P., Tsikopoulos N.: Independence number, connectivity and f-factors. Utilitas Math 57, 81–95 (2000)

    MathSciNet  MATH  Google Scholar 

  5. Kouider M., Lonc Z.: Stability number and [a, b]-factors in graphs. J. Graph Theory 46(4), 254–264 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Kouider M., Ouatiki S.: Stability number and even [2,b]-factors in graphs. AKCE J. Graphs Combin. 7(2), 151–169 (2010)

    MathSciNet  MATH  Google Scholar 

  7. Kouider M., Vestergaard P.D.: On even [2, b]-factors in graphs. Aust. J. Combin. 27, 139–147 (2003)

    MathSciNet  MATH  Google Scholar 

  8. Kouider M., Vestergaard P.D.: Even [a, b]-factors in graphs. Disc. Math. Graph Theory 24, 431–441 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kouider M., Vestergaard P.D.: Connected factors in graphs, a survey. Graphs Combin. 21, 1–26 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lovász L.: Subgraphs with prescribed valencies. J. Combin. Theory 9, 391–416 (1970)

    Google Scholar 

  11. Neumann-Lara V., Rivera-Campo E.: Spanning trees with bounded degrees. Combinatorica 11(1), 55–61 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Nishimura T.: Independence number, connectivity, and r-factors. J Graph Theory 13(1), 63–69 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  13. Plummer M.D.: Graph factors and factorization, a survey. Discret. Math. 307(7–8), 791–821 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Tutte W.T.: Graph factors. Combinatorica 1, 70–97 (1981)

    Article  MathSciNet  Google Scholar 

  15. Zhou S.: Indepenpdence number connectivity and (a, b, k)-critical graphs. Discret. Math. 309(12), 4144–4148 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LRI, Univ. Paris-Sud, UMR 8623, 91405, Orsay Cedex, France

    Mekkia Kouider

  2. LAID3, Faculté de Mathématiques, U.S.T.H.B, BP. 32, El-Alia, Algeria

    Saliha Ouatiki

Authors
  1. Mekkia Kouider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saliha Ouatiki
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Saliha Ouatiki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kouider, M., Ouatiki, S. Sufficient Condition for the Existence of an Even [a, b]-Factor in Graph. Graphs and Combinatorics 29, 1051–1057 (2013). https://doi.org/10.1007/s00373-012-1168-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1168-9

Keywords

Search

Navigation