Largest 4‐connected components of 3‐connected planar triangulations

DOI10.1002/rsa.3240070402zbMath0839.05090OpenAlexW1482867605MaRDI QIDQ4858237

L. Bruce Richmond, Edward A. Bender, Nicholas C. Wormald

Publication date: 5 June 1996

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240070402

zbMATH Keywords

cycleplanar triangulationsrandom triangulation

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial probability (60C05) Graph theory (05C99)

Related Items

Limit of normalized quadrangulations: the Brownian map ⋮ Random cubic planar maps ⋮ Uniform infinite planar triangulations ⋮ Random maps, coalescing saddles, singularity analysis, and Airy phenomena ⋮ A probabilistic approach to block sizes in random maps

Cites Work

• Random triangulations of the plane
• Simple paths on polyhedra
• A Census of Planar Triangulations