Topological graphs with no self-intersecting cycle of length 4
From MaRDI portal
Publication:5361609
DOI10.1145/777792.777807zbMATH Open1376.05037OpenAlexW2036637777MaRDI QIDQ5361609FDOQ5361609
Authors: Radoa Radoicic, Rom Pinchasi
Publication date: 29 September 2017
Published in: Proceedings of the nineteenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/777792.777807
Recommendations
- scientific article; zbMATH DE number 2145243
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- scientific article; zbMATH DE number 1974129
- Geometric graphs with no self-intersecting path of length three
Cited In (7)
This page was built for publication: Topological graphs with no self-intersecting cycle of length 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361609)