The number of labeled 2-connected planar graphs
From MaRDI portal
Publication:1856337
zbMath1021.05052MaRDI QIDQ1856337
Edward A. Bender, Nicholas C. Wormald, Zhi-Cheng Gao
Publication date: 13 May 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122875
Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Asymptotic enumeration (05A16)
Related Items (26)
Classes of graphs embeddable in order-dependent surfaces ⋮ Characterisation of symmetries of unlabelled triangulations ⋮ The maximum degree of random planar graphs ⋮ Random graphs from a weighted minor-closed class ⋮ Graph classes with given 3-connected components: asymptotic counting and critical phenomena ⋮ The evolution of random graphs on surfaces ⋮ Statistics of Feynman amplitudes in \(\phi^4\)-theory ⋮ Random cubic planar graphs converge to the Brownian sphere ⋮ Cubic graphs and related triangulations on orientable surfaces ⋮ Asymptotic enumeration and limit laws for graphs of fixed genus ⋮ On the Diameter of Random Planar Graphs ⋮ Local convergence of random planar graphs ⋮ The Evolution of Random Graphs on Surfaces ⋮ Enumeration of labelled 4-regular planar graphs. II: Asymptotics ⋮ Random graphs on surfaces ⋮ Enumeration and limit laws for series-parallel graphs ⋮ The structure of \(K_{3,3}\)-subdivision-free toroidal graphs ⋮ Random planar maps and graphs with minimum degree two and three ⋮ Degree distribution in random planar graphs ⋮ Random planar graphs ⋮ Planar graphs, via well-orderly maps and trees ⋮ Uniform random sampling of planar graphs in linear time ⋮ Asymptotic enumeration and limit laws of planar graphs ⋮ Structure and enumeration of two-connected graphs with prescribed three-connected components ⋮ Two critical periods in the evolution of random planar graphs ⋮ Unnamed Item
This page was built for publication: The number of labeled 2-connected planar graphs
