Number of crossing-free geometric graphs vs. Triangulations

DOI10.1016/J.ENDM.2008.06.039MaRDI QIDQ5301006zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

countingcrossing-free geometric graphsnumber of triangulations

Mathematics Subject Classification ID

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

Recommendations

• The Number of Crossing Free Configurations on Finite Point Sets in the Plane
• Counting plane graphs with exponential speed-up
• Counting triangulations of planar point sets
• Counting and enumerating crossing-free geometric graphs
• Counting and enumerating crossing-free geometric graphs

Cites work

• scientific article; zbMATH DE number 5506218 (Why is no real title available?)
• Analytic combinatorics of non-crossing configurations
• Crossing-Free Subgraphs
• Flipping edges in triangulations
• On the number of plane graphs
• Triangulations intersect nicely

Cited in

(13)

• Counting plane graphs: cross-graph charging schemes
• Counting plane graphs with exponential speed-up
• On crossing numbers of geometric proximity graphs
• Counting the number of crossings in geometric graphs
• Reporting the crossing-free segments of a complete geometric graph
• On degrees in random triangulations of point sets
• Convex polygons in geometric triangulations
• From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
• Counting triangulations and other crossing-free structures approximately
• Random triangulations of planar points sets
• Convex Polygons in Geometric Triangulations
• The Number of Crossing Free Configurations on Finite Point Sets in the Plane
• A new lower bound on the maximum number of plane graphs using production matrices

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)