AbstractWe show that the visibility graph of a set of non-intersecting translates of the same compact convex object in R2 always contains a Hamiltonian path. Furthermore, we show that every other edge in the Hamiltonian path can be used to obtain a perfect matching that is realized by a set of non-intersecting lines of sight
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We show that the visibility graph of a set of non-intersecting translates of the same compact convex...
AbstractWe show that the visibility graph of a set of non-intersecting translates of the same compac...
AbstractWe show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian,...
A geometric graph is a graph embedded in the plane in such a way that vertices correspond to points ...
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segmen...
We consider visibility representations of graphs in which the vertices are presented by a collection...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractWe show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian,...
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two para...
Abstract. Let s denote a compact convex object in IR 2. The f-width of s is the perpendicular distan...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We show that the visibility graph of a set of non-intersecting translates of the same compact convex...
AbstractWe show that the visibility graph of a set of non-intersecting translates of the same compac...
AbstractWe show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian,...
A geometric graph is a graph embedded in the plane in such a way that vertices correspond to points ...
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segmen...
We consider visibility representations of graphs in which the vertices are presented by a collection...
AbstractLet P be a set of n points in convex position in the plane. The path graph G(P) of P is the ...
A feasible family of paths in a connected graph G is a family that contains at least one path betwee...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractWe show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian,...
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two para...
Abstract. Let s denote a compact convex object in IR 2. The f-width of s is the perpendicular distan...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
We consider the exploration of a simple polygon P by a robot that moves from vertex to vertex along ...
DOI
Add to ORKG