Codage et dénombrement de diverses structures apparentées à celle d'arbre

 Access to full text

 Full (PDF)

1. [1] Kirchhoff G. - Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann. Phys. Chem.72 (1847) 497-508. 
2. Kirchhoff G. - Uber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Gesammelte Abhandlungen, Leipzig (1882) 22-33. 
3. [2] Cayley A. - A theorem on trees. Quart. J. Math.23 (1889) 376-378. JFM21.0687.01
4. Cayley A. - A theorem on treesCollected Math papers, Cambridge. n° 895. 13 (1897) 26-28. JFM21.0687.01
5. [3] Dziobek O. - Eine Formel der Substitutions theorie. Sitz. Berliner Math. Gesell.17 (1917) 64-67 JFM46.0106.03
6. [4] Prufer H. - Neuer Beweis eines Satzes über Permutationen. Arch. Math. Phys.27 (1918) 142-144 Zbl46.0106.04JFM46.0106.04
7. [5] Polya G. - Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math.68 (1937) 145-254. MR1577579JFM63.0547.04
8. [6] Bol G. - Uber eine kombinatorische Frage. Abh. Math. Sem. Hansischen Univ.12 (1938) 242-245. Zbl64.0041.01JFM64.0041.01
9. [7] Brooks R.L., Smith C.A.B., Stone A.H. & Tutte W.T. - The dissection of rectangles into squares. Duke Math. J.7 (1940) 312-340. Zbl0024.16501MR3040
10. [8] Husimi K. - Note on Mayer's theory of cluster integrals. J. Chem. Phys.18 (1950) 682-684 MR38903
11. [9] Harary F. & Uhlenbeck G.E. - On the number of Husimi trees. Proc. Nat. Acad. Sci.U.S.A.39 (1953) 315-322. Zbl0053.13104MR53893
12. [10] Neville E.H. - The codifying of tree-structure. Proc. Cambridge Philos. Soc.49 (1953) 381-385. Zbl0050.17904MR54936
13. [11] Trent H.M. - A note on the enumeration and listing of all possible trees in a connected linear graph. Proc. Nat. Acad. Sci.U.S.A.40 (1954) 1004-1007. Zbl0055.42204MR67466
14. [12] Katz L. - Probability of indecomposability of a random mapping function. Ann. Math. Statist.26 (1955) 512-517. Zbl0065.11604MR70869
15. [13] Ford G.W. & Uhlenbeck G.E. - Combinatorial problems in the theory of graphs I. Proc. Nat. Acad. Sci.U.S.A.42 (1956) 122-128. Zbl0071.39101MR78683
16. [14] Clarke L.E. - On Cayley's formula for counting trees. J. London Math. Soc.33 (1958) 471-474. Zbl0084.19303MR100854
17. [15] Weinberg L. - Number of trees in a graph. Proc. IRE46 (1958) 1954-1955. 
18. [16] Denes J. - The representation of a permutation as the product of a minimal number of transpositions, and its connection with the theory of graphs. Magyar Tudom. Akad. Mat Kutato Int. Közl.4 (1959) 63-70. Zbl0092.01104MR115936
19. [17] Renyi A. - Some remarks on the theory of trees. Magyar Tudom. Akad Mat Kutato Int. Közl.4 (1959) 73-85. Zbl0093.37604MR115938
20. [18] Austin T.L. - The enumeration of point labelled chromatic graphs and trees. Canad. J. Math.12 (1960) 535-545. Zbl0096.17802MR139544
21. [19] Eden M. & Schutzenberger M.P. - Remark on a theorem of Dénes. Magyar Tudom. Akad Mat. Kutato Int. Közl.7A3 (1962) 353-355. Zbl0114.01207MR170830
22. [20] Scoins H.I. - The number of trees with nodes of alternate parity. Proc. Cambridge Philos. Soc.58 (1962) 12-16. Zbl0122.41901MR136554
23. [21] Glicksman S. - On the representation and enumeration of trees. Proc. Cambridge Philos. Soc.59 (1963) 509-517. Zbl0115.17402MR157374
24. [22] Moon J.W. - Another proof of Cayley's formula for counting trees. Amer. Math. Monthly70 (1963) 846-847. Zbl0121.40202MR1532311
25. [23] O'Neil P.V. - The number of trees in a certain network. Notices Amer. Math. Soc.10 (1963) 569. 
26. [24] Moon J.W. - On the second moment of the complexity of a graph. Mathematika11 (1964) 95-98. Zbl0134.43504MR175115
27. [25] Moon J.W. - Various proofs of Cayley's formula for counting trees. In a A Seminar on Graph Theory (1967) 70-78. F. Harary ed. Holt, Rinehart and Winston. New York. MR214515
28. [26] Moon J.W. - Enumerating labelled trees. In Graph Theory and Theoretical Physics (1967), 261-272. F. Harary ed. Academic Press. London and New York Zbl0204.24502MR231755
29. [27] Berge C. - Principes de combinatoire. Dunod ed. Paris1968. Zbl0227.05001MR237346
30. [28] Poupard Y. - Algorithme de la greffe et dénombrement de diverses familles d'arbres. Math. Sci. Hum.21 (1968) 29-38. MR294169
31. [29] Schutzenberger M.P. - On an enumeration problem. J. Combinatorial Theory4 (1968) 219-221. Zbl0157.03501MR218257
32. [30] Beineke L.W. & Pippert R.E. - The number of labeled k-dimensional trees. J. Combinatorial Theory6 (1969) 200-205. Zbl0175.20904MR234868
33. [31] Moon J.W. - The number of labeled k-trees. J. Combinatorial Theory6 (1969) 196-199. Zbl0175.50203MR237382
34. [32] Harary F. - Graph theory. Addison-Wesley1969. Zbl0182.57702MR256911
35. [33] Kreweras G. - Intermédiaire, dendroïdes et quasi-dualité, à paraître dans : Math. Sci. Hum.29 (1970). Zbl0207.54901