default search action
"On topological graphs with at most four crossings per edge."
Eyal Ackerman (2019)
- Eyal Ackerman:
On topological graphs with at most four crossings per edge. Comput. Geom. 85 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.