Skip to main content
SpringerLink
Log in

A sufficient condition for a graph to have [a, b]-factors

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We give a sufficient condition by using neighborhoods for a graph to have [a, b]-factors.

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 Theory9, 1–42 (1985)

    Google Scholar 

  2. Amahashi, A., Kano, M.: Factors with given components. Ann. Discrete Math.42, 1–6 (1982)

    Google Scholar 

  3. Anderson, I.: Perfect matchings of a graph. J. Combin. Theory (B)10, 183–186 (1971)

    Google Scholar 

  4. Behzad, F., Chartrand, G. and Lesniak-Foster, L.: Graphs and digraphs. Boston: Prindle, Qeber and Schmidt, 1979

    Google Scholar 

  5. Berge, C., Las Vergnas, M.: On the existence of subgraphs with degree constraints. Proc. K. Ned. Acad. Wet. Amsterdam, (A)81, 165–176 (1978).

    Google Scholar 

  6. Cui, Y., Kano, M.: Some results on odd factors of graphs. J. Graph Theory,12, 327–333 (1988)

    Google Scholar 

  7. Enomoto, H., Ota, K. and Kano, M.: A sufficient condition for a bipartite graph to have ak-factor. J. Graph Theory,12, 141–151 (1988)

    Google Scholar 

  8. Lovász, L.: Subgraphs with prescribed valencies. J. Comb. Theory9, 391–416 (1970)

    Google Scholar 

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

    Google Scholar 

  10. Woodall, D.R.: The binding number of a graph and its Anderson number. J. Comb. Theory (B) 15, 225–255 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Akashi College of Technology, 674, Uozumi, Akashi, Japan

    Mikio Kano

Authors
  1. Mikio Kano
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor Tuyosi Oyama on his 60th Birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kano, M. A sufficient condition for a graph to have [a, b]-factors. Graphs and Combinatorics 6, 245–251 (1990). https://doi.org/10.1007/BF01787576

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Search

Navigation