DOIAbstract
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This proves a conjecture of Mirzaian
AbstractWe show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This proves a conjecture of Mirzaian
An n-vertex simple polygon P is said to have a Hamiltonian Triangulation if it has a triangulation w...
Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the pl...
In the thesis we study visibility graphs focusing on the Big Line Big Clique conjecture. For a given...
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...
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...
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,...
AbstractGiven a set of n disjoint line segments in the plane, the segment visibility graph is the gr...
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 disjoint congruent discs in R2 is Hamiltonian,...
Given a finite set S of n nonintersecting line segments with no three end points collinear, the segm...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractTwo vertices of a simple polygon P are visible if the line segment joining them does not int...
An n-vertex simple polygon P is said to have a Hamiltonian Triangulation if it has a triangulation w...
Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the pl...
In the thesis we study visibility graphs focusing on the Big Line Big Clique conjecture. For a given...
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...
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...
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,...
AbstractGiven a set of n disjoint line segments in the plane, the segment visibility graph is the gr...
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 disjoint congruent discs in R2 is Hamiltonian,...
Given a finite set S of n nonintersecting line segments with no three end points collinear, the segm...
AbstractTwo vertices A and B of a simple polygon P are (mutually) visible if AB does not intersect t...
AbstractTwo vertices of a simple polygon P are visible if the line segment joining them does not int...
An n-vertex simple polygon P is said to have a Hamiltonian Triangulation if it has a triangulation w...
Abstract. We show that every segment endpoint visibility graph on Ò disjoint line segments in the pl...
In the thesis we study visibility graphs focusing on the Big Line Big Clique conjecture. For a given...
Add to ORKG