Skip to main content
SpringerLink
Log in

On (g, f)-Uniform Graphs

  • Original Papers
  • Published:
Acta Mathematicae Applicatae Sinica Aims and scope Submit manuscript

Abstract

A graph G is called a (g, f)-uniform graph if for each edge of G, there is a (g, f)-factor containing it and another (g, f)-factor excluding it. In this paper a necessary and sufficient condition for a graph to be a (g, f)-uniform graph is given and some applications of this condition are discussed. In particular, some simple sufficient conditions for a graph to be an [a, b]-uniform graph are obtained for a ≤ b.

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  MATH  MathSciNet  Google Scholar 

  2. Chen, C., Liu, G. Toughness of graph and [a, b]-factors with prescribed properties. JCMCC, 125:215–221 (1992)

    Google Scholar 

  3. Kano, M. [a, b]-factorizations of a graph. J. Graph Theory 9:129–146 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Liu, Guizhen. On covered (g, f)-covered graphs,. Acta Math. Scientia, 8:181–184 (1988)

    MATH  Google Scholar 

  5. Liu, Guizhen. (g, f)-facrors and factorizations in graphs. Acta math. Sinica, 37:230–237 (1994)

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  7. Lovász, L. Ear-decomposition of matching-covered graphs. Combinatorica, 2:395–407 (1983)

    Google Scholar 

  8. Niessen, T. A characterization of graph having all (g, f)-factors. J. Combin. Theory (Series B), 72:152–156 (1998)

    Article  MathSciNet  Google Scholar 

  9. Plummer, M.D. On n-extendable graphs. Discrete Math., 3:201–310 (1980)

    Article  MathSciNet  Google Scholar 

  10. Tutte, W.T. The factors of graphs. Canad. J. Math., 4:314–328 (1952)

    MATH  MathSciNet  Google Scholar 

  11. Wallis, W.D. One factorizations. Kluwer Academic Publishers, Dordreht, Boston, 1997

  12. Xu, B., Liu, Z., Tokuda, T. Connected factors in K 1,n -free graphs containing a (g, f)-factor. Graphs and Combinatorics, 14:393–395 (1998)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Shandong University, Jinan 250100, China

    Gui-zhen Liu

  2. Department of Mathematics, Southern Normal University, Guangzhou 510631, China

    Yan Liu

Authors
  1. Gui-zhen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gui-zhen Liu.

Additional information

Supported by National Natural Science Foundation (10471078, 10201019) and RSDP (20040422004) of China

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, Gz., Liu, Y. On (g, f)-Uniform Graphs. Acta Mathematicae Applicatae Sinica, English Series 21, 67–76 (2005). https://doi.org/10.1007/s10255-005-0216-0

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10255-005-0216-0

Keywords

2000 MR Subject Classification

Search

Navigation