Number of crossing-free geometric graphs vs. Triangulations
From MaRDI portal
Publication:5301006
DOI10.1016/J.ENDM.2008.06.039zbMATH Open1267.05097OpenAlexW1965976352WikidataQ54308706 ScholiaQ54308706MaRDI QIDQ5301006FDOQ5301006
Authors: Andreas Razen, Jack Snoeyink, Emo Welzl
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.039
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30)
Cites Work
Cited In (13)
- Random triangulations of planar points sets
- Counting plane graphs with exponential speed-up
- On degrees in random triangulations of point sets
- Convex Polygons in Geometric Triangulations
- Monotone paths in geometric triangulations
- The Number of Crossing Free Configurations on Finite Point Sets in the Plane
- Reporting the crossing-free segments of a complete geometric graph
- On crossing numbers of geometric proximity graphs
- Convex polygons in geometric triangulations
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Counting plane graphs: cross-graph charging schemes
- Counting the number of crossings in geometric graphs
- Counting triangulations and other crossing-free structures approximately
This page was built for publication: Number of crossing-free geometric graphs vs. Triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301006)