Skip to main content
Log in

On factors with all degrees odd

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A {1,3,...,2n−1}-factor of a graphG is defined to be a spanning subgraph ofG each degree of whose vertices is one of {1,3,...,2n−1}, wheren is a positive integer. In this paper, we give criterions for the existence of a {1,3,...,2n−1}-factor in a tree and in a graph.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Amahashi, A., Kano, M.: On factors with given components. Discrete Math.42, 1–6 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  2. Anderson, I.: Perfect matching in a graph. J. Comb. Theory (B)10, 183–186 (1971)

    Article  MATH  Google Scholar 

  3. Bollobás, B.: Graph Theory. Graduate Texts in Mathematics 63. New York: Springer 1979

    MATH  Google Scholar 

  4. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. London: Macmillan 1976

    Google Scholar 

  5. Hall, P.: On representatives of subsets. J. London Math. Soc. (2)10, 26–30 (1935)

    MATH  Google Scholar 

  6. Las Vergnas, M.: An extension of Tutte's 1-factor theorem. Discrete Math.23, 241–255 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lovász, L.: Combinatorial Problems and Exercises. Amsterdam: North-Holland 1979

    MATH  Google Scholar 

  8. Petersen, J.: Die Theorie der regulären graphs. Acta Math.15, 193–220 (1891)

    Article  MathSciNet  Google Scholar 

  9. Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc. (2)22, 107–111 (1947)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Amahashi, A. On factors with all degrees odd. Graphs and Combinatorics 1, 111–114 (1985). https://doi.org/10.1007/BF02582935

Download citation

  • Issue Date:

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

Keywords

Navigation