AbstractWe show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian, as long as the discs are not all supported by the same line. The proof is constructive, and leads to efficient algorithms for obtaining a Hamilton circuit
We show that the visibility graph of a set of non-intersecting translates of the same compact convex...
AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree g...
In this paper, we are going to explore a survey of line graphs and hamiltonian paths. Research conce...
AbstractWe show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian,...
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segmen...
AbstractWe prove that the endpoint visibility graph of a set of disjoint segments that satisfy one o...
AbstractLet Σ={S1,…,Sn} be a finite set of disjoint line segments in the plane. We conjecture that i...
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segmen...
AbstractLet Σ={S1,…,Sn} be a finite set of disjoint line segments in the plane. We conjecture that i...
AbstractWe show that the visibility graph of a set of non-intersecting translates of the same compac...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractWe prove that the endpoint visibility graph of a set of disjoint segments that satisfy one o...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractWe show that the visibility graph of a set of non-intersecting translates of the same compac...
We show that the visibility graph of a set of non-intersecting translates of the same compact convex...
AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree g...
In this paper, we are going to explore a survey of line graphs and hamiltonian paths. Research conce...
AbstractWe show that the visibility graph of a set of disjoint congruent discs in R2 is Hamiltonian,...
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segmen...
AbstractWe prove that the endpoint visibility graph of a set of disjoint segments that satisfy one o...
AbstractLet Σ={S1,…,Sn} be a finite set of disjoint line segments in the plane. We conjecture that i...
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segmen...
AbstractLet Σ={S1,…,Sn} be a finite set of disjoint line segments in the plane. We conjecture that i...
AbstractWe show that the visibility graph of a set of non-intersecting translates of the same compac...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractWe prove that the endpoint visibility graph of a set of disjoint segments that satisfy one o...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractWe show that the visibility graph of a set of non-intersecting translates of the same compac...
We show that the visibility graph of a set of non-intersecting translates of the same compact convex...
AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree g...
In this paper, we are going to explore a survey of line graphs and hamiltonian paths. Research conce...
DOI
Add to ORKG