Article ID Journal Published Year Pages File Type
4649954 Discrete Mathematics 2008 14 Pages PDF
Abstract

We give sufficient (and necessary) conditions of local character ensuring that a geometric graph is the 1-skeleton of an unstacked triangulation of a simple polygon.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Geometric graphs which are 1-skeletons of unstacked triangulated polygons
Authors
, ,