Largest 4‐connected components of 3‐connected planar triangulations

DOI10.1002/RSA.3240070402zbMATH Open0839.05090OpenAlexW1482867605MaRDI QIDQ4858237FDOQ4858237

Authors: Edward A. Bender, L. Bruce Richmond, Nicholas 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

Recommendations

• The Size of the Largest Components in Random Planar Maps
• Maximal biconnected subgraphs of random planar graphs
• Random triangulations of the plane
• Circumference of essentially 4-connected planar triangulations
• Maximal biconnected subgraphs of random planar graphs

zbMATH Keywords

cycleplanar triangulationsrandom triangulation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• A probabilistic approach to block sizes in random maps
• On properties of random dissections and triangulations
• The distribution of the number of small cuts in a random planar triangulation
• Uniform infinite planar triangulations
• Random cubic planar maps
• Limit of normalized quadrangulations: the Brownian map
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena

This page was built for publication: Largest 4‐connected components of 3‐connected planar triangulations

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