Enumeration and limit laws for series-parallel graphs

European Journal of Combinatorics

Volumn 28, Issue 8, 2007, Pages 2091-2105

  Bodirsky, Manuel ^a   Giménez, Omer ^b   Kang, Mihyun ^a   Noy, Marc ^c  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35148827501     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.04.011     Document Type: Article

References (9)

1. Bender E.A., Gao Z., and Wormald N.C. The number of 2-connected labelled planar graphs. Electron. J. Combin. 9 (2002) #43
2. Bonichon N., Gavoille C., and Hanusse N. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation. Springer Lecture Notes in Computer Science vol. 2280 (2003) 81-92
3. Flajolet P., and Noy M. Analytic combinatorics of non-crossing configurations. Discrete Math. (1999)
4. Flajolet P., and Odlyzko A. Singularity analysis of generating functions. SIAM J. Discrete Math. 3 (1990) 216-240
5. P. Flajolet, R. Sedgewick, Analytic Combinatorics (in preparation). Preliminary version available at: http://algo.inria.fr/flajolet/Publications
6. Gerke S., and McDiarmid C. On the number of edges in random planar graphs. Combin. Probab. Comput. 13 (2004) 165-183
7. Giménez O., and Noy M. Asymptotic enumeration and limit laws of planar graphs. arXiv:math.CO/0501269 14 pages
8. Moon J.W. Counting labelled trees. Canadian Mathematical Monographs (1970), Canadian Mathematical Congress, Montreal, Que.1
9. Walsh T.R.S. Counting labelled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B 32 (1982) 1-11