We show that if all internal vertices of a disc triangulation have degree at least 6, then the full structure can be determined from the pairwise graph distances between boundary vertices. A similar result holds for disc quadrangulations with all internal vertices having degree at least 4. This confirms a conjecture of Itai Benjamini. Both degree bounds are best possible, and correspond to local non-positive curvature. However, we show that a natural conjecture for a “mixed” version of the two results is not true
AbstractA simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such ...
Given a finite point set P in general position in the plane, a full triangulation is a maximal strai...
AbstractThe distance d(u,v) between two vertices u and v in a nontrivial connected graph G is the le...
We study ¿ip graphs of triangulations whose maximum vertex degree is bounded by a constant k. In par...
D. Sleator, R. Tarjan, and W. Thurston discovered that the diameter of the triangulation graph Γk wa...
peer reviewedWe study flip-graphs of triangulations on topological surfaces where distance is measur...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
AbstractFor a pair of vertices x and y in a graph G, we denote by dG(x,y) the distance between x and...
AbstractA vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distan...
AbstractWe provide bounds for the product of the lengths of distinguished shortest paths in a finite...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
Given a triangulation G, whose vertex set V is a set of n points in the plane, and given a real numb...
We present two versions of a method for generating all triangulations of any punctured surface in ea...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
AbstractLet T be a triangulation of a bordered compact surface, and let C be a boundary component of...
AbstractA simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such ...
Given a finite point set P in general position in the plane, a full triangulation is a maximal strai...
AbstractThe distance d(u,v) between two vertices u and v in a nontrivial connected graph G is the le...
We study ¿ip graphs of triangulations whose maximum vertex degree is bounded by a constant k. In par...
D. Sleator, R. Tarjan, and W. Thurston discovered that the diameter of the triangulation graph Γk wa...
peer reviewedWe study flip-graphs of triangulations on topological surfaces where distance is measur...
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G ...
AbstractFor a pair of vertices x and y in a graph G, we denote by dG(x,y) the distance between x and...
AbstractA vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distan...
AbstractWe provide bounds for the product of the lengths of distinguished shortest paths in a finite...
A simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such that eve...
Given a triangulation G, whose vertex set V is a set of n points in the plane, and given a real numb...
We present two versions of a method for generating all triangulations of any punctured surface in ea...
AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the sa...
AbstractLet T be a triangulation of a bordered compact surface, and let C be a boundary component of...
AbstractA simple quadrangulation of the sphere is a finite simple graph embedded on the sphere such ...
Given a finite point set P in general position in the plane, a full triangulation is a maximal strai...
AbstractThe distance d(u,v) between two vertices u and v in a nontrivial connected graph G is the le...