2000 character limit reached
Computing the vertex connectivity of a locally maximal 1-plane graph in linear time
Published 12 Dec 2021 in math.CO and cs.DM | (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$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.