3-Connected Cores In Random Planar Graphs

DOI10.1017/S0963548310000532zbMath1223.05277arXiv0907.2326OpenAlexW2108315536MaRDI QIDQ2998851

Nikolaos Fountoulakis, Konstantinos D. Panagiotou

Publication date: 11 May 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0907.2326

zbMATH Keywords

labelled biconnected graphslarge random planar graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

Connectivity for Bridge-Addable Monotone Graph Classes ⋮ The maximum degree of random planar graphs ⋮ Concentration of maximum degree in random planar graphs ⋮ Random graphs from a weighted minor-closed class ⋮ Phase transitions in graphs on orientable surfaces ⋮ Random graphs from a block-stable class ⋮ Graph classes with given 3-connected components: Asymptotic enumeration and random graphs

Cites Work

• Counting labelled three-connected and homeomorphically irreducible two- connected graphs
• Random planar graphs
• Asymptotic enumeration and limit laws of planar graphs
• Random Trees
• Boltzmann Samplers for the Random Generation of Combinatorial Structures

This page was built for publication: 3-Connected Cores In Random Planar Graphs