C. Berge, Graphs and Hypergraphs, 1973.

S. Caminiti, I. Finocchi, and R. Petreschi, On coding labeled trees, Theoretical Computer Science, vol.382, issue.2, pp.97-108, 2007.
DOI : 10.1016/j.tcs.2007.03.009

H. C. Chen and Y. L. Wang, An efficient algorithm for generating Prüfer codes from labelled trees, Theory of Computing Systems, pp.97-105, 2000.

W. Edelson and M. L. Gargano, Modified Prüfer code: O(n) implementation, Graph Theory Notes of, pp.37-39, 2001.

F. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

M. Karonski and T. Luczak, The number of connected sparsely edged uniform hypergraphs, Discrete Mathematics, vol.171, issue.1-3, pp.153-167, 1997.
DOI : 10.1016/S0012-365X(96)00076-3

D. E. Knuth, The Art of, Computer Programing, vol.13, 1973.

G. Labelle, Une nouvelle d??monstration combinatoire des formules d'inversion de Lagrange, Advances in Mathematics, vol.42, issue.3, pp.217-247, 1981.
DOI : 10.1016/0001-8708(81)90041-4

J. W. Moon, Various proofs of Cayley's Formula for Counting Trees, A Seminar on Graph Theory, pp.0-78, 1967.

A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, 1978.

H. Prüfer, Neuer Beweis eines SatzesüberSatzes¨Satzesüber Permutationen, Arch. Math. Phys, vol.27, pp.742-744, 1918.

V. Ravelomanana and A. L. Rijamamy, Creation and Growth of Components in a Random Hypergraph Process, Proc. of Cocoon, pp.350-359, 2006.
DOI : 10.1007/11809678_37
URL : https://hal.archives-ouvertes.fr/hal-00085237

C. Rényi and A. Rényi, The Prüfer code for k-trees, in: Combinatorial Theory and its Applications III, pp.945-971, 1970.

B. I. Selivanov, Perechislenie odnorodnyckh hipergrafov c protsto? ? ciklovo? ? strukturo? ?, Kombinatorny? ? Analiz, pp.60-67, 1972.

S. Shannigrahi and S. P. , Efficient Prüfer-Like Coding and Counting Labelled Hypertrees , Algorithmica, pp.8-225, 2009.