Segment endpoint visibility graphs are Hamiltonian
نویسندگان
چکیده
منابع مشابه
Segment endpoint visibility graphs are hamiltonian
We 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.
متن کاملPlanar segment visibility graphs
Given a set of n disjoint line segments in the plane, the segment visibility graph is the graph whose 2n vertices correspond to the endpoints of the line segments and whose edges connect every pair of vertices whose corresponding endpoints can see each other. In this paper we characterize and provide a polynomial time recognition algorithm for planar segment visibility graphs. Actually, we char...
متن کاملBipartite Kneser Graphs are Hamiltonian
The Kneser graph K(n, k) has as vertices all k-element subsets of [n] := {1, 2, . . . , n} and an edge between any two vertices (=sets) that are disjoint. The bipartite Kneser graph H(n, k) has as vertices all k-element and (n−k)-element subsets of [n] and an edge between any two vertices where one is a subset of the other. It has long been conjectured that all connected Kneser graphs and bipar...
متن کامل10-Gabriel graphs are Hamiltonian
Given a set S of points in the plane, the k-Gabriel graph of S is the geometric graph with vertex set S, where pi, pj ∈ S are connected by an edge if and only if the closed disk having segment pipj as diameter contains at most k points of S \ {pi, pj}. We consider the following question: What is the minimum value of k such that the k-Gabriel graph of every point set S contains a Hamiltonian cyc...
متن کاملSparse Kneser graphs are Hamiltonian
For integers k ≥ 1 and n ≥ 2k + 1, the Kneser graph K(n, k) is the graph whose vertices are the k-element subsets of {1, . . . , n} and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form K(2k + 1, k) are also known as the odd graphs. We settle an old problem due to Meredith, Lloyd, and Biggs from the 1970s, proving that for every k ≥ 3, the odd graph K(2k + 1,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2003
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(02)00172-4