论文信息 - The number of trees with a 1-factor - 字舞流文

The number of trees with a 1-factor

Abstract The asymptotic behaviour of the number of trees with a 1-factor is determined for various families of trees.

John W. Moon | J. Moon

[1] R. W. Robinson,et al. Twenty-step algorithm for determining the asymptotic number of trees of various speces , 1975, Journal of the Australian Mathematical Society.

[2] Yair Caro,et al. Generalized 1-factorization of trees , 1981, Discret. Math..

[3] R. Otter. The Number of Trees , 1948 .

[4] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .

[5] G. Pólya. Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen , 1937 .

[6] J. Riordan. The numbers of labeled colored and chromatic trees , 1957 .

[7] W. T. Tutte. The Factors of Graphs , 1952, Canadian Journal of Mathematics.

[8] R. Otter. The Multiplicative Process , 1949 .

[9] John W. Moon,et al. Hereditarily finite sets and identity trees , 1983, J. Comb. Theory, Ser. B.

[10] P. Erdos,et al. On the existence of a factor of degree one of a connected random graph , 1966 .

[11] Michael D. Plummer,et al. On the 1-factors of a non-separable graph , 1967 .

[12] N. Biggs,et al. Graph Theory 1736-1936 , 1976 .

[13] Frank H. Clarke,et al. A graph polynomial and its applications , 1972, Discret. Math..

[14] J. Moon,et al. On the Altitude of Nodes in Random Trees , 1978, Canadian Journal of Mathematics.