The Maximum Degree of Series-Parallel Graphs

DOI10.1017/S0963548311000198zbMath1223.05276OpenAlexW1969971703MaRDI QIDQ5199507

Michael Drmota, Marc Noy, Omer Giménez

Publication date: 16 August 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548311000198

zbMATH Keywords

2-connected outerplanar graphsrandom series-parallel graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Maximum degree in minor-closed classes of graphs, The maximum degree of random planar graphs, Random graphs from a weighted minor-closed class, Random cubic planar maps, On the Diameter of Random Planar Graphs, Extremal statistics on non-crossing configurations, Random planar maps and graphs with minimum degree two and three, Unnamed Item, Graph classes with given 3-connected components: Asymptotic enumeration and random graphs, Spanning trees in random series-parallel graphs

Cites Work

• Degree distribution in random planar graphs
• A bivariate asymptotic expansion of coefficients of powers of generating functions
• The distribution of the maximum vertex degree in random planar maps
• Enumeration and limit laws for series-parallel graphs
• Vertices of given degree in series-parallel graphs
• A Generalisation of Stirling's Formula.
• Singularity Analysis of Generating Functions
• Random Trees
• On the Maximum Degree of a Random Planar Graph
• The Degree Sequence of Random Graphs from Subcritical Classes