On maximal planarization of nonplanar graphs

In this paper, we first point out that the planarization algorithm due to Ozawa and Takahashi [4] does not in general produce a maximal planar subgraph when applied on a nonplanar graph. However, we prove that the algorithm produces a maximal planar subgraph in the case of a complete graph.