Spanning maximal planar subgraphs of random graphs
From MaRDI portal
Publication:3974713
DOI10.1002/RSA.3240020206zbMATH Open0766.05077OpenAlexW2090934506MaRDI QIDQ3974713FDOQ3974713
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
Recommendations
Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
Cited In (7)
- 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
- Maximal planar subgraphs of fixed girth in random graphs
- Spanning subgraphs of random graphs
- The spanning maximal planar subgraph problem for some classes of complete 4-partite 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)