Add to ORKGWe consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same layer cross
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and th...
AbstractGiven a set V of points in the plane and given d > 0, let G(V, d) denote the graph with vert...
Increasing attention has been given recently to drawings of graphs in which edges connect vertices b...
We consider two classes of higher order proximity graphs defined on a set of points in the plane, na...
AbstractLet P be a set of n points in the plane. A geometric proximity graph on P is a graph where t...
Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated...
Given a set P of n points in the plane, the order-k Delaunay graph is a graph with vertex set P and ...
Given a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a g...
We study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead...
We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a set P of poin...
In this work we study the order-k Delaunay graph, which is formed by edges pq having a circle throug...
In this paper we study proximity structures for geometric graphs. The study of these structures was ...
The spanning ratio of a graph defined on n points in the Euclidean plane is the maximal ratio over a...
We study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead...
AbstractWe examine the graph coloring problem for three families of Euclidean proximity graphs. Resu...
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and th...
AbstractGiven a set V of points in the plane and given d > 0, let G(V, d) denote the graph with vert...
Increasing attention has been given recently to drawings of graphs in which edges connect vertices b...
We consider two classes of higher order proximity graphs defined on a set of points in the plane, na...
AbstractLet P be a set of n points in the plane. A geometric proximity graph on P is a graph where t...
Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated...
Given a set P of n points in the plane, the order-k Delaunay graph is a graph with vertex set P and ...
Given a set $\emph{P}$ of $\emph{n}$ points in the plane, the order-$\emph{k}$ Delaunay graph is a g...
We study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead...
We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a set P of poin...
In this work we study the order-k Delaunay graph, which is formed by edges pq having a circle throug...
In this paper we study proximity structures for geometric graphs. The study of these structures was ...
The spanning ratio of a graph defined on n points in the Euclidean plane is the maximal ratio over a...
We study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead...
AbstractWe examine the graph coloring problem for three families of Euclidean proximity graphs. Resu...
We study a new family of geometric graphs that interpolate between the Delaunay triangulation and th...
AbstractGiven a set V of points in the plane and given d > 0, let G(V, d) denote the graph with vert...
Increasing attention has been given recently to drawings of graphs in which edges connect vertices b...