The polytope of non-crossing graphs on a planar point set

DOI10.1007/s00454-004-1143-1zbMath1063.68077arXivmath/0302126OpenAlexW1977413884MaRDI QIDQ1772132

Francisco Santos, David Orden

Publication date: 15 April 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0302126

zbMATH Keywords

rigid graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52B99)

Related Items (10)

On the number of plane geometric graphs ⋮ Combinatorial pseudo-triangulations ⋮ A proof of the orbit conjecture for flipping edge-labelled triangulations ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ On minimum weight pseudo-triangulations ⋮ Pre-triangulations and liftable complexes ⋮ On the number of pseudo-triangulations of certain point sets ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ The complex of non-crossing diagonals of a polygon ⋮ Connectivity of triangulation flip graphs in the plane

This page was built for publication: The polytope of non-crossing graphs on a planar point set