Random triangulations of the plane

DOI10.1016/S0195-6698(88)80028-3zbMath0663.05059MaRDI QIDQ1114717

Nicholas C. Wormald, L. Bruce Richmond

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

triangulationshamiltonianbicubic maps

Mathematics Subject Classification ID

Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items

Largest 4‐connected components of 3‐connected planar triangulations, Uniform infinite planar triangulations, The bivariate Ising polynomial of a graph, Asymptotic normality determined by high moments, and submap counts of random maps, Graph structural properties of non-Yutsis graphs allowing fast recognition, The asymptotic number of rooted maps on a surface. II: Enumeration by vertices and faces, Distributions of near-4-regular maps on the sphere and the projective plane, A survey of the asymptotic behaviour of maps, Hamiltonian cycles in cubic 3-connected bipartite planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple paths on convex polyhedra
• On the enumeration of convex polyhedra
• A Remark on Stirling's Formula
• A Theorem on Planar Graphs
• A Census of Planar Triangulations
• Enumeration of cyclically 4-connected cubic graphs
• Asymptotic Methods in Enumeration
• A Census of Planar Maps
• On Hamiltonian Circuits