On Computing Vertex Connectivity of 1-Plane Graphs

Therese Biedl, Karthik Murali

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G\setminus S$ is disconnected. For the class of planar graphs, the problem of ver…