On the size of planarly connected crossing graphs
DOI:
https://doi.org/10.7155/jgaa.00453Abstract
We prove that if anDownloads
Downloads
Published
2018-01-01
How to Cite
Ackerman, E., Keszegh, B., & Vizer, M. (2018). On the size of planarly connected crossing graphs. Journal of Graph Algorithms and Applications, 22(1), 11–22. https://doi.org/10.7155/jgaa.00453
Issue
Section
Articles
Categories
License
Copyright (c) 2018 Eyal Ackerman, Balázs Keszegh, Mate Vizer

This work is licensed under a Creative Commons Attribution 4.0 International License.