The Number of Labeled 2-Connected Planar Graphs

  • Edward A. Bender
  • Zhicheng Gao
  • Nicholas C. Wormald
DOI: https://doi.org/10.37236/1659

Abstract

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.

Published
2002-11-10
Issue
Volume 9 (2002)
Article Number
R43