Number of Crossing-Free Geometric Graphs vs. Triangulations

DOI10.1016/j.endm.2008.06.039zbMath1267.05097OpenAlexW1965976352WikidataQ54308706 ScholiaQ54308706MaRDI QIDQ5301006

Jack Scott Snoeyink, Andreas Razen, Ermo 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

zbMATH Keywords

countingcrossing-free geometric graphsnumber of triangulations

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

Convex Polygons in Geometric Triangulations ⋮ Convex Polygons in Geometric Triangulations ⋮ Counting Plane Graphs: Cross-Graph Charging Schemes ⋮ On degrees in random triangulations of point sets ⋮ Monotone paths in geometric triangulations

Cites Work

• Unnamed Item
• Analytic combinatorics of non-crossing configurations
• Flipping edges in triangulations
• Triangulations intersect nicely
• On the number of plane graphs
• Crossing-Free Subgraphs

This page was built for publication: Number of Crossing-Free Geometric Graphs vs. Triangulations