Combinatorial pseudo-triangulations

DOI10.1016/j.disc.2005.09.045zbMath1109.05037arXivmath/0307370OpenAlexW2089708856MaRDI QIDQ864146

David Orden, Brigitte Servatius, Francisco Santos, Herman J. Servatius

Publication date: 13 February 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

rigidityplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (6)

Matching edges and faces in polygonal partitions ⋮ On the number of pseudo-triangulations of certain point sets ⋮ Unnamed Item ⋮ 3-Colorability of Pseudo-Triangulations ⋮ A vertex-face assignment for plane graphs ⋮ FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ray shooting in polygons using geodesic triangulations
• Non-crossing frameworks with non-crossing reciprocals
• The polytope of non-crossing graphs on a planar point set
• Planar minimally rigid graphs and pseudo-triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• On graphs and rigidity of plane skeletal structures
• Construction of Self-Dual Graphs

This page was built for publication: Combinatorial pseudo-triangulations