This is a preview of subscription content, log in via an institution to check access.
Références
D. André, Sur les permutations alternées,J. Math. Pures et Appliquées 7 (1881), 167–184.
A. Cayley, A theorem on trees,Quart. J. Math. 23 (1889), 376–378.
J. Dénes, The representation of a permutation as the product of a minimal number of transpositions, and its connection with the theory of graphs,Magyar Tud. Akad. Mat. Kutató Int. Közl. 4 (1959), 63–71.MR 22 # 6733
F. Harary, The number of linear, directed, rooted and connected graphs,Trans. Amer. Math. Soc. 78 (1955), 445–463.MR 16-844
G. Kreweras, Sur les éventails de segments,Cahiers du B. U. R. O. 15 (1970), 3–41.
Y. Poupard, Codage et dénombrement de diverses structures apparentées à celle d'arbre,Cahiers du B. U. R. O. 16 (1971), 7–83.
J. Riordan,Combinatorial identities, Wiley, New York, 1968.MR 38 # 53
I. Gessel etDa-lun Wang, Depth-first search as a combinatorial correspondence,J. Combin. Theory Ser. A 26 (1979), 308–313.
C. L. Mallows etJ. Riordan, The inversion enumerator for labelled trees,Bull. Amer. Math. Soc. 74 (1968), 92–94.MR 36 # 1341
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kreweras, G. Une famille de polynômes ayant plusieurs propriétés énumeratives. Period Math Hung 11, 309–320 (1980). https://doi.org/10.1007/BF02107572
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02107572