On computing the vertex connectivity of 1-plane graphs

DOI10.4230/LIPICS.ICALP.2023.23MaRDI QIDQ6638016

Karthik Murali, Therese Biedl

Publication date: 14 November 2024

zbMATH Keywords

treewidthconnectivitylinear time1-planar graph

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

This page was built for publication: On computing the vertex connectivity of 1-plane graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638016)