\begin{thebibliography}{99}

%\bibitem {AuLe03}
%Pierre Auger and Pierre Leroux, \emph{Computing the molecular expansion of species 
%with the Maple Package Devmol}, $49^{th}$ S\'eminaire Lotharingien de Combinatoire, In preparation.
\bibitem {AuLaLe02}
Pierre Auger, Gilbert Labelle and Pierre Leroux, 
\emph{Combinatorial addition formulas and applications},
Advances in Applied Mathematics, 28 (2002), 302--342.

%\bibitem[Bergeron, Labelle et Leroux, 1994]{BLL94} Bergeron, Fran\c{c}ois, Gilbert Labelle et Pierre Leroux. 1994. \emph{Th\'eorie des esp\`eces et combinatoire des structures arborescentes}. Coll. `` Publications du LACIM'', vol. 19. Montr\'eal: LACIM, 394 p.

%
\bibitem {BLL98} %[Bergeron, Labelle et Leroux, 1998]
Fran\c{c}ois Bergeron, Gil\-bert Labelle and Pierre Leroux,
\emph{Combinatorial Species and Tree-Like Structures}, 
Cambridge University Press, 1998, 457\,p.
Vol. 67 of the series Encyclopedia of Mathema\-tics and its Applications.
%

\bibitem{BBLL00} %[B\'ona \emph{et al.}, 2000]
Mikl\'os B\'ona, Michel Bousquet, Gilbert Labelle and Pierre Leroux, 
\emph{Enumeration of $m$-ary cacti},
Advances in Applied Mathematics, 24, 2000, 22--56.

\bibitem{Ch92}
Yves Chiricota, \emph{Structures combinatoires et calcul symbolique},
PhD Thesis, UQAM, 1992, Publications du LaCIM, Vol. 12, 1993.

\bibitem {FGLL02} %[Fowler \emph{et al}, 2002]
Tom Fowler, Ira Gessel, Gilbert Labelle and Pierre Leroux, 
\emph{The specification of 2-tress}, Advances in Applied Mathematics, 28, 2002, 145--168. 

\bibitem {Ha69} %[Harary, 1969]
 Frank Harary, \emph{Graph Theory}, Addison-Wesley, 1969, 274 p.

%
\bibitem {HaPa73} %[Harary et Palmer, 1973]
 Frank Harary and Edgar Palmer.  \emph{Graphical Enumeration}, Academic Press, New York and London,
1973, 271 p.
%
%
\bibitem {Hu50} %[Husimi, 1950]
Kodi Husimi.  \emph{Note on Mayers' theory of cluster integrals}, 
The Journal of Chemical Physics, 18, 1950, 682--684.
%

%
\bibitem {Jo81} %[Joyal, 1981]
Andr\'e Joyal, \emph{Une th\'eorie combinatoire des s\'eries formelles},
Advances in Mathematics, 42, 1981, 1--82.
%

%\bibitem[Labelle G., 1981]{Lag81}Labelle, Gilbert. 1981. `` Une nouvelle d\'emonstration combinatoire des formules d'in\-version de Lagrange''. \emph{Advances in Mathematics}, vol. 42, p. 217-247.

\bibitem{La92} %[Labelle, 1992]
Gilbert Labelle, \emph{Counting asymmetric enriched trees}, 
Journal of Symbolic Computation, 14, 1992, 211--242.

\bibitem{LaLaLe02}
 Gilbert Labelle, C\'edric Lamathe, Pierre Leroux, \emph{\'Enum\'eration des 2-arbres $k$-gonaux},
Proceedings of the conference Mathematics and Computer Science:
Algorithms, Trees, Combinatorics and Probabilities,
Versailles, September 16--19, 2002, 
in \emph{Mathematics and Computer Science II}, 
B. Chauvin, P. Flajolet, D. Gardy, and A. Mokkadem, ed., Birkh\"{a}user, Basel,
2002, 95--109.

\bibitem{LaLaLe03} %[Labelle, Lamathe et Leroux, \`a para\^{\i}tre]
Gilbert Labelle, C\'edric Lamathe and Pierre Leroux, \emph{A classification of plane and planar 2-trees},
Theoretical Computer Science, To appear. 

%\bibitem {La83} %[Labelle, 1983]
%Labelle, Jacques, \emph{Applications diverses de la th\'eorie combinatoire 
%des esp\`eces de structures}, Annales des Sciences Math\'ematiques du Qu\'ebec, 7, 1983, 59--94.

%
\bibitem {Le88} %[Leroux, 1988]
Pierre Leroux,  \emph{Methoden der Anzahl\-bestimmung f\"ur einige Klassen von Graphen},
Bayreuther Mathematische Schriften, 26, 1988, 1--36.
%

\bibitem {Le03}
Pierre Leroux,  \emph{Enumerative problems inspired by Mayer's theory of cluster integrals},
Plenary talk, FPSAC03 Conference, Link\"oping University (Sweden), June 23 - 27, 2003.
%

%
\bibitem {LeMi92} %[Leroux et Miloudi, 1992]
Pierre Leroux and Brahim Miloudi,  
\emph{G\'en\'eralisations de la formule d'Otter}, 
Annales des Sciences Math\'ematiques du Qu\'ebec, 16, 1992,  53--80.

\bibitem {Na02} %[Nadeau, 2002]
M\'elanie Nadeau,  \emph{Graphes de Husimi, cactus, et m\'ecanique
statistique}.  M\'emoire de ma\^{\i}trise, UQAM, 2002. 

\bibitem {No54}
Robert Z. Norman, \emph{On the number of linear graphs with given blocks}, 
Dissertation, University of Michigan, 1954.

\bibitem{Ot48} %[Otter, 1948]
Richard Otter, \emph{The number of trees}, Annals of Mathematics, 49, 1948, 583--599.

%\bibitem[P\'olya, 1937]{Po37}P\'olya, George. 1937. ``Kombinatorische Anzahl\-bestimmungen f\"ur Gruppe, 
%Graphen und chemische Verbindungen''. \emph{Acta Math.}, vol. 68, p. 145-254.

%\bibitem[P\'olya et Read, 1987]{PoRe87}P\'olya, Georges et Ronald Read. 1987. \emph{Combinatorial Enumeration of Groups, Graphs and Chemical Compounds}. New York: Springer-Verlag, 148 p.

\bibitem {Ro70} %[Robinson, 1970]
Robert Robinson,  \emph{Enumeration of non-separable graphs}, 
Journal of Combinatorial Theory, 9, 1970, 327--356.

\bibitem {Sp96} %[Springer, 1996] 
Colin Springer,  \emph{Factorizations, trees, and cacti}, 
Proceedings of the Eighth International Conference on Formal Power Series and Algebraic Combinatorics 
(FPSAC), University of Minnesota, 1996, 427--438.

%\bibitem[Stanley, 1997]{St97}Stanley, Richard. 1997. \emph{Enumerative Combinatorics: volume 1}. Cambridge University Press. 326 p.

%\bibitem[Tutte, 1966]{Tu66}Tutte, William Thomas 1966. \emph{Connectivity in Graphs}. University of Toronto Press, \mbox{145 p.}

%
%\bibitem {UhFo63} %[Uhlenbeck et Ford, 1963]
%George Uhlenbeck et George Ford, \emph{Lectures in Statistical Mechanics}, 
%Amer. Math. Soc., Providence, Rhode Island, 1963, 181 p.


\end{thebibliography}
