Graph classes with given 3-connected components: Asymptotic enumeration and random graphs

From MaRDI portal
Publication:2841679

DOI10.1002/rsa.20421zbMath1269.05060arXiv0907.0376OpenAlexW2099787737MaRDI QIDQ2841679

Marc Noy, Juanjo Rué, Omer Giménez

Publication date: 26 July 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.0376



Related Items

Maximum degree in minor-closed classes of graphs, Quenched local convergence of Boltzmann planar maps, Triangles in random cubic planar graphs, Asymptotic Properties of Some Minor-Closed Classes of Graphs, Random enriched trees with applications to random graphs, The maximum degree of random planar graphs, On the sum of digits of some sequences of integers, Longest and shortest cycles in random planar graphs, Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023, Multi-critical behaviour of 4-dimensional tensor models up to order 6, Limits of random tree-like discrete structures, Unnamed Item, Asymptotic enumeration and limit laws for graphs of fixed genus, On the maximal offspring in a subcritical branching process, On the Diameter of Random Planar Graphs, Local convergence of random planar graphs, Enumeration of labelled 4-regular planar graphs. II: Asymptotics, Logical limit laws for minor-closed classes of graphs, Random planar maps and graphs with minimum degree two and three, Maximal independent sets and maximal matchings in series-parallel and related graph classes, Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs, Random graphs from a block-stable class, Expected Maximum Block Size in Critical Random Graphs, On the probability of planarity of a random graph near the critical point, Enumeration of chordal planar graphs and maps, Unnamed Item, Spanning trees in random series-parallel graphs



Cites Work