Computing the vertex connectivity of a locally maximal 1-plane graph in linear time
Combinatorics
2021-12-14 v1 Discrete Mathematics
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
Keywords
Cite
@article{arxiv.2112.06306,
title = {Computing the vertex connectivity of a locally maximal 1-plane graph in linear time},
author = {Therese Biedl and Karthik Murali},
journal= {arXiv preprint arXiv:2112.06306},
year = {2021}
}
Comments
11 pages, 4 figures