The asymptotic enumeration of rooted convex polyhedra

DOI10.1016/0095-8956(84)90033-9zbMATH Open0527.05038OpenAlexW2016640915MaRDI QIDQ595676FDOQ595676

Authors: Edward A. Bender, L. Bruce Richmond 

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90033-9

zbMATH Keywords

asymptotic formularooted c-nets

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx) Enumeration in graph theory (05C30)

Cites Work

• The Number of Rooted Convex Polyhedra
• The Asymptotic Number of Convex Polyhedra
• A Census of Planar Maps
• Title not available (Why is that?)
• Title not available (Why is that?)
• Central and local limit theorems applied to asymptotic enumeration
• The enumeration of c-nets via quadrangulations
• Asymptotic Methods in Enumeration
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Title not available (Why is that?)

Cited In (7)

• A survey of the asymptotic behaviour of maps
• Degree distribution in random planar graphs
• Face sizes of 3-polytopes
• Submaps of maps. I: General 0-1 laws
• Uniform random sampling of planar graphs in linear time
• The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces
• Asymptotic enumeration and limit laws for graphs of fixed genus

This page was built for publication: The asymptotic enumeration of rooted convex polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595676)