@inproceedings{b6345e761be342e598e8bcb596e4ef8b,
title = "Cut Vertices in Random Planar Graphs",
abstract = "We denote by P(n, m) a graph chosen uniformly at random from the class of all vertex-labelled planar graphs on vertex set {1, …, n} with m= m(n) edges. We determine the asymptotic number of cut vertices in P(n, m) in the sparse regime. For comparison, we also derive the asymptotic number of cut vertices in the Erd{\H o}s-R{\'e}nyi random graph G(n, m).",
keywords = "Cut vertices, Random graphs, Random planar graphs",
author = "Mihyun Kang and Michael Missethan",
year = "2021",
doi = "10.1007/978-3-030-83823-2_4",
language = "English",
isbn = "978-3-030-83822-5",
series = "Trends in Mathematics",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "18--24",
booktitle = "Extended Abstracts EuroComb 2021",
address = "Germany",
note = "European Conference on Combinatorics, Graph Theory and Applications : EuroComb 2021 ; Conference date: 06-09-2021 Through 10-09-2021",
}