Title

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

Share

COinS