2005 International Conference on Analysis of Algorithms
Conrado Martínez (ed.)
DMTCS Conference Volume AD (2005), pp. 147156
author:  Omer Giménez and Marc Noy 

title:  The number of planar graphs and properties of random planar graphs 
keywords:  Planar graph, random graph, asymptotic enumeration, limit law, normal law, analytic combinatorics. 
abstract: 
We show an asymptotic estimate for the number of labelled
planar graphs on
n
vertices. We also find limit laws for the number of
edges, the number of connected components, and other
parameters in random planar graphs.

If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files.  
reference:  Omer Giménez and Marc Noy (2005), The number of planar graphs and properties of random planar graphs, in 2005 International Conference on Analysis of Algorithms, Conrado Martínez (ed.), Discrete Mathematics and Theoretical Computer Science Proceedings AD, pp. 147156 
bibtex:  For a corresponding BibTeX entry, please consider our BibTeXfile. 
ps.gzsource:  dmAD0114.ps.gz (83 K) 
pssource:  dmAD0114.ps (205 K) 
pdfsource:  dmAD0114.pdf (113 K) 
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Di Sep 27 10:09:31 CEST 2005 by gustedt