Computing the vertex connectivity of a locally maximal 1-plane graph in linear time (2112.06306v1)

Abstract: It is known that the vertex connectivity of a planar graph can be computed in linear time. We extend this result to the class of locally maximal 1-plane graphs: graphs that have an embedding with at most one crossing per edge such that the endpoints of each pair of crossing edges induce the complete graph $K_4$