What is the size of the smallest set of vertices in planar graph when removed the remaining graph has only one outerface (outer face)?
Is this parameter well studied? Does it have a name? A case of special interest is the class of bipartite 2-connected graphs.