Skip to main content
SpringerLink
Log in

Degree Conditions for Graphs to be Fractional (a, b, n)-Critical Graphs

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

Let G be a graph, and a and b be integers with a≤ b. A graph G is called a fractional (a, b, n)-critical graph if after any n vertices of G are deleted the remaining subgraph has a fractional [a, b]-factor. In this paper two degree conditions for graphs to be fractional (a, b, n)-critical graphs are presented, and the degree conditions are sharp in some sense.

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. J. A. Bondy and U. R. Murty, Graph Theory with Applications, Macmillan, New York, 1976.

    Google Scholar 

  2. M. D. Plummer, On n-extendable graphs, Discrete Math., 1980, 31: 201–210.

    Article  Google Scholar 

  3. L. Lovász, On the structure of factorizabl graph, Acta Math. Acad. Sci. Hung., 1972, 23: 179–195.

    Article  Google Scholar 

  4. Q. Yu, Characterizations of various matching extension graphs, Australian Journal of Combin., 1993, 7: 55–64.

    Google Scholar 

  5. O. Favaron, On k-factor-critical graphs, Discussions Mathematicae–Graph Theory, 1996, 16: 41–51.

    Google Scholar 

  6. G. Liu and Q. Yu, k-factors and extendability with prescribed components, Congr. Numer., 1999, 139: 77–88.

    Google Scholar 

  7. G. Liu and J. Wang, (a, b, n)-critical graphs, Advance in Mathematics, 1998, 27: 536-540.

    Google Scholar 

  8. K. Heinrich, P. Hell, et al., A simple existence criterion for (g, f)-factors, Discerte Math., 1990, 85: 313–317.

    Article  Google Scholar 

  9. K. Ota and T. Tokuda, A degree condition for the existence of regular factors in K 1, n -free graphs, J. Graph Theory, 1996, 22: 59–64.

    Article  Google Scholar 

  10. Y. Li and M. Cai, A degree condition for graph to have [a, b]-factor, J. Graph Theory, 1998, 27: 1–6.

    Article  Google Scholar 

  11. T. Iida and T. Nishimura, An Ore-type conditions for the existence of k-factors in graphs, Graph and Combintorics, 1991, 7: 353–361.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Hunan University of Science and Technology, Xiangtan, 411201, China

    Jianxiang Li

  2. School of Management, Shandong Normal University, Jinan, 25014, China

    Yinghong Ma

Authors
  1. Jianxiang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinghong Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jianxiang Li.

Additional information

This research was partially supported by Science and Technology Department of Hunan Province under Grant No. 04Fj4105.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, J., Ma, Y. Degree Conditions for Graphs to be Fractional (a, b, n)-Critical Graphs. Jrl Syst Sci & Complex 19, 491–497 (2006). https://doi.org/10.1007/s11424-006-0491-8

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-006-0491-8

Key Word

Search

Navigation