Citation
Therese Biedl, Karthik Murali. On computing vertex connectivity of 1-planar graphs. // Algorithmica. – 2025. – DOI: 10.1007/s00453-025-01355-3. – URL: https://doi.org/10.1007/s00453-025-01355-3
Therese Biedl & Karthik Murali (2025). On computing vertex connectivity of 1-planar graphs. Algorithmica. https://doi.org/10.1007/s00453-025-01355-3
Therese Biedl and Karthik Murali. “On computing vertex connectivity of 1-planar graphs.” Algorithmica, 2025. doi:10.1007/s00453-025-01355-3.
@article{Biedl2025,
title = {On computing vertex connectivity of 1-planar graphs},
author = {Biedl, Therese and Murali, Karthik},
journal = {Algorithmica},
year = {2025},
doi = {10.1007/s00453-025-01355-3},
url = {https://doi.org/10.1007/s00453-025-01355-3}
}