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.
Similar content being viewed by others
References
Amahashi, A., Kano, M.: On factors with given components. Discrete Math.42, 1–6 (1982)
Anderson, I.: Perfect matching in a graph. J. Comb. Theory (B)10, 183–186 (1971)
Bollobás, B.: Graph Theory. Graduate Texts in Mathematics 63. New York: Springer 1979
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. London: Macmillan 1976
Hall, P.: On representatives of subsets. J. London Math. Soc. (2)10, 26–30 (1935)
Las Vergnas, M.: An extension of Tutte's 1-factor theorem. Discrete Math.23, 241–255 (1978)
Lovász, L.: Combinatorial Problems and Exercises. Amsterdam: North-Holland 1979
Petersen, J.: Die Theorie der regulären graphs. Acta Math.15, 193–220 (1891)
Tutte, W.T.: The factorization of linear graphs. J. London Math. Soc. (2)22, 107–111 (1947)
Author information
Authors and Affiliations
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/BF02582935