On numbers of pseudo-triangulations
From MaRDI portal
Publication:1947983
DOI10.1016/j.comgeo.2012.11.002zbMath1272.65021arXiv1210.7126OpenAlexW2964172622MaRDI QIDQ1947983
André Schulz, Moria Ben-Ner, Adam Sheffer
Publication date: 29 April 2013
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7126
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Counting triangulations of planar point sets
- On degrees in random triangulations of point sets
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Planar minimally rigid graphs and pseudo-triangulations
- On the number of plane geometric graphs
- Gray code enumeration of plane straight-line graphs
- On the number of pseudo-triangulations of certain point sets
- On graphs and rigidity of plane skeletal structures
- Counting Plane Graphs: Flippability and Its Applications
- Counting plane graphs
- On Constrained Minimum Pseudotriangulations
- On the Number of Crossing‐Free Matchings, Cycles, and Partitions
- On the Number of Spanning Trees a Planar Graph Can Have
- Crossing-Free Subgraphs
- Counting Plane Graphs: Cross-Graph Charging Schemes
- Acute triangulations of polygons
This page was built for publication: On numbers of pseudo-triangulations
