Spanning maximal planar subgraphs of random graphs

DOI10.1002/RSA.3240020206MaRDI QIDQ3974713zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Alan Frieze

Publication date 25 June 1992

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240020206

zbMATH Keywords

random graphspanning maximal planar subgraph

Mathematics Subject Classification ID

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

Recommendations

• Maximal planar subgraphs of fixed girth in random graphs
• Spanning subgraphs of random graphs
• scientific article; zbMATH DE number 747032

Cites work

• A Census of Planar Triangulations

Cited in

(7)

• The spanning maximal planar subgraph problem for some classes of complete 4-partite graphs
• Maximal planar subgraphs of fixed girth in random graphs
• Spanning subgraphs of random graphs
• On the non-planarity of a random subgraph
• The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
• Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs
• Large planar subgraphs in dense graphs

This page was built for publication: Spanning maximal planar subgraphs of random graphs

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