论文信息 - Enumeration and limit laws for series-parallel graphs - 字舞流文

Enumeration and limit laws for series-parallel graphs

M. Bodirsky | Mihyun Kang | Omer Giménez | M. Noy

[1] Omer Giménez,et al. Asymptotic enumeration and limit laws of planar graphs , 2005, math/0501269.

[2] Colin McDiarmid,et al. On the Number of Edges in Random Planar Graphs , 2004, Combinatorics, Probability and Computing.

[3] Philippe Flajolet,et al. Analytic combinatorics of non-crossing configurations , 1999, Discret. Math..

[4] Philippe Flajolet,et al. Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[5] Timothy R. S. Walsh,et al. Counting labelled three-connected and homeomorphically irreducible two-connected graphs , 1982, J. Comb. Theory, Ser. B.

[6] C. Gavoille,et al. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation , 2005, J. Graph Algorithms Appl..

[7] Nicolas Bonichon,et al. Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation , 2003, WG.

[8] J. Moon. Counting labelled trees , 1970 .