Maximal biconnected subgraphs of random planar graphs

DOI10.1145/1721837.1721847MaRDI QIDQ2930307zbMATH OpenOpenAlexFDO

Authors Angelika Steger, Konstantinos Panagiotou

Publication date 18 November 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1721837.1721847

zbMATH Keywords

graphs with constraintsplanar graphsrandom structures

Mathematics Subject Classification ID

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

Recommendations

• Maximal biconnected subgraphs of random planar graphs
• Blocks in constrained random graphs with fixed average degree
• 3-Connected Cores In Random Planar Graphs
• Random planar graphs
• The maximum degree of random planar graphs

Cited in

(22)

• Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs
• Maximal planar subgraphs of fixed girth in random graphs
• Random planar maps and graphs with minimum degree two and three
• Limits of random tree-like discrete structures
• Concentration of maximum degree in random planar graphs
• Graph classes with given 3-connected components: asymptotic enumeration and random graphs
• The maximum degree of random planar graphs
• Blocks in constrained random graphs with fixed average degree
• Random graphs from a weighted minor-closed class
• A probabilistic approach to block sizes in random maps
• Maximal biconnected subgraphs of random planar graphs
• Largest 4‐connected components of 3‐connected planar triangulations
• scientific article; zbMATH DE number 7626718 (Why is no real title available?)
• Phase transitions in graphs on orientable surfaces
• Expected Maximum Block Size in Critical Random Graphs
• On the diameter of random planar graphs
• On degrees in random triangulations of point sets
• Exact-Size Sampling of Enriched Trees in Linear Time
• Longest and shortest cycles in random planar graphs
• Asymptotic enumeration and limit laws for multisets: the subexponential case
• Sackin indices for labeled and unlabeled classes of galled trees
• Random graphs from a block-stable class

This page was built for publication: Maximal biconnected subgraphs of random planar graphs

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