Counting enriched multigraphs according to the number of their edges (or arcs)

Discrete Mathematics

Volumn 217, Issue 1-3, 2000, Pages 237-248

  Labelle, Gilbert ^a  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347647515     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00265-4     Document Type: Article

References (17)

1. F. Bergeron, G. Labelle, P. Leroux, Théorie des espèces et combinatoire des structures arborescentes, Publication du LACIM, no. 19, Université du Québec à Montréal, 1994. English version: Combinatorial species and tree-like structures, Encyclopedia of Mathematics and its Applications vol. 67, Cambridge University Press, Cambridge, 1998.
2. F. Bergeron, G. Labelle, P. Leroux, Théorie des espèces et combinatoire des structures arborescentes, Publication du LACIM, no. 19, Université du Québec à Montréal, 1994. English version: Combinatorial species and tree-like structures, Encyclopedia of Mathematics and its Applications vol. 67, Cambridge University Press, Cambridge, 1998.
3. B.W. Char, K.O. Geddes, G.H. Gonnet, B.L. Leong, M.B. Monagan, S.M. Watt, MAPLE V Language Reference Manual, Springer, NY, 1991.
4. H. Décoste, G. Labelle, P. Leroux, The functorial composition of species: a forgotten operation, Discrete Math. 99 (1992) 31-48.
5. P. Hanlon, R.W. Robinson, Counting Bridgeless Graphs, J. Combin. Theory Ser. B 33 (1982) 276-305.
6. F. Harary, E.M. Palmer, Graphical Enumeration, Academic Press, NY, 1973.
7. A. Joyal, Une théorie combinatoire des séries formelles, Adv. Math. 42 (1) (1981) 1-82.
8. G. Labelle, Une nouvelle démonstration combinatoire des formules d'inversion de Lagrange, Adv. Math. 42 (3) (1981) 217-247.
9. J. Labelle, Applications diverses de la théorie combinatoire des espèces de structures, Annales des sciences mathématiques du Québec 7 (1) (1983) 59-94.
10. G. Labelle, Counting asymmetric enriched trees, J. Symbolic Comput. 14 (1992) 211-242.
11. G. Labelle, On asymmetric structures, Discrete Math. 99 (1992) 141-164.
12. G. Labelle, Sur la symétrie et l'asymétrie des structures combinatoires, Theoret. Comput. Sci. 117 (1993) 3-22.
13. G. Pölya, R.C. Read, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, Springer, New York, 1987.
14. R.C. Read, Some applications of a theorem of deBruijn, in: F. Harary (Ed.), Graph Theory and Theoretical Physics, Academic Press, New York, pp. 1967, 273-280.
15. G.-C. Rota, D. Kahaner, A. Odlyzko, On the foundations of combinatorial theory, VIII: finite operator calculus, J. Math. Anal. Appl. 42 (3) (1973) 684-760.
16. N.J.A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, New York, 1995.
17. N. Worwald, E.M. Wright, The exponential generating function of labelled blocks, Discrete Math. 25 (1979) 93-96.