Cut vertices in random planar graphs

DOI10.1007/978-3-030-83823-2_4MaRDI QIDQ6604667zbMATH OpenFDO

Authors Mihyun Kang, Michael Missethan

Publication date 13 September 2024

Full work available at URL https://doi.org/10.1007/978-3-030-83823-2_4

zbMATH Keywords

cut verticesrandom graphsrandom planar graphs

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites work

• Asymptotic enumeration and limit laws of planar graphs
• scientific article; zbMATH DE number 4183464 (Why is no real title available?)
• scientific article; zbMATH DE number 7651049 (Why is no real title available?)
• Phase transitions in graphs on orientable surfaces
• Random graphs.
• Random planar graphs with n nodes and a fixed number of edges
• Two critical periods in the evolution of random planar graphs

Cited in

(2)

• The uniform infinite cubic planar graph
• Upper bounds for some graph invariants in terms of blocks and cut-vertices

This page was built for publication: Cut vertices in random planar graphs

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