Spanning maximal planar subgraphs of random graphs
Abstract
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn, p . We show that it is very near p = 1/n⅓ We also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near p = 1/n½. Copyright © 1991 Wiley Periodicals, Inc., A Wiley Company
Publication Title
Random Structures & Algorithms
Recommended Citation
Bollobás, B., & Frieze, A. (1991). Spanning maximal planar subgraphs of random graphs. Random Structures & Algorithms, 2 (2), 225-231. https://doi.org/10.1002/rsa.3240020206
COinS
