\magnification=1200
\hsize=4in
\nopagenumbers
\noindent
%
%
{\bf Edward A. Bender, Zhicheng Gao and \hfil\break
Nicholas C. Wormald}
%
%
\medskip
\noindent
%
%
{\bf The Number of Labeled 2-Connected Planar Graphs}
%
%
\vskip 5mm
\noindent
%
%
%
%
We derive the asymptotic expression for the number of labeled
2-connected planar graphs
with respect to vertices and edges. We also show that almost all such
graphs with $n$ vertices
contain many copies of any fixed planar graph, and this implies that
almost all such graphs have large automorphism groups.
\bye