Geodesic
The number of labeled 2-connected planar graphs
The electronic journal of combinatorics, Tome 9 (2002)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/1659
Classification : 05C30, 05A16, 05A15
Mots-clés : asymptotic expression, labeled 2-connected planar graphs 
@article{10_37236_1659,
     author = {Edward A. Bender and Zhicheng Gao and Nicholas C. Wormald},
     title = {The number of labeled 2-connected planar graphs},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     doi = {10.37236/1659},
     zbl = {1021.05052},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1659/}
}
TY  - JOUR
AU  - Edward A. Bender
AU  - Zhicheng Gao
AU  - Nicholas C. Wormald
TI  - The number of labeled 2-connected planar graphs
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1659/
DO  - 10.37236/1659
ID  - 10_37236_1659
ER  - 
%0 Journal Article
%A Edward A. Bender
%A Zhicheng Gao
%A Nicholas C. Wormald
%T The number of labeled 2-connected planar graphs
%J The electronic journal of combinatorics
%D 2002
%V 9
%U http://geodesic.mathdoc.fr/articles/10.37236/1659/
%R 10.37236/1659
%F 10_37236_1659
Edward A. Bender; Zhicheng Gao; Nicholas C. Wormald. The number of labeled 2-connected planar graphs. The electronic journal of combinatorics, Tome 9 (2002). doi: 10.37236/1659

Cité par Sources :