Indexed metadata
The Number of Labeled 2-Connected Planar Graphs
Edward A. Bender, Zhicheng Gao, Nicholas C. Wormald
Source 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 vertices contain many copies of any fixed planar graph, and this implies that almost all such graphs have large automorphism groups.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.