Forests and score vectors. (English) Zbl 0491.05028
References:
| [1] | I. Gessel andD. L. Wang, Depth-First Search as a Combinatorial Correspondence,Journal of Combinatorial Theory (A),26 (1979), 308–313. · Zbl 0417.05031 · doi:10.1016/0097-3165(79)90108-0 |
| [2] | D. J. Kleitman, The Number of Tournament Score Sequences for a Large Number of Players,Combinatorial Structures and Their Applications, University of Calgary, Alberta, (1969), 209–213. |
| [3] | D. J. Kleitman andD. L. Wang, Algorithms for Constructing Graphs and Digraphs with Given Valences and Factors,Discrete Math. 6 (1973), 79–88. · Zbl 0263.05122 · doi:10.1016/0012-365X(73)90037-X |
| [4] | A. Rényi, Some Remarks on the Theory of Trees,MTA Matematikai Kutató Intézetének Közleményei (Publ. of Math. Inst. Hung.) 4 (1959), 73–85. |
| [5] | N. J. A. Sloane,A Handbook of Integer Sequences, Academic Press, 1973. · Zbl 0286.10001 |
| [6] | R. Stanley, Decompositions of Rational Convex Polytopes,Proceedings of Symposium on Combinatorial Mathematics and Optimal Design, Colorado State University (June, 1978), to appear. · Zbl 0812.52012 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
