3 citations · 5 across the 7 of their papers we have counts for
1 paper · 1 filter
Therese Biedl, Karthik Murali
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…