On the number of plane graphs
DOI10.1145/1109557.1109613zbMATH Open1192.05069OpenAlexW4238175697WikidataQ61732497 ScholiaQ61732497MaRDI QIDQ3581579FDOQ3581579
Authors: Oswin Aichholzer, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, Hannes Krasser, T. Hackl
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109613
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cited In (6)
- On the number of higher order Delaunay triangulations
- A new lower bound on the maximum number of plane graphs using production matrices
- Number of crossing-free geometric graphs vs. Triangulations
- On the number of plane geometric graphs
- On the number of pseudo-triangulations of certain point sets
- Minimum number of partial triangulations
This page was built for publication: On the number of plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581579)