Segment endpoint visibility graphs are Hamiltonian (Q1395575): Difference between revisions

@@ Property / cites work @@
+Can visibility graphs be represented compactly?
@@ Property / cites work: Can visibility graphs be represented compactly? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945520
@@ Property / cites work: Q4945520 / rank @@
+Normal rank
@@ Property / cites work @@
+Every set of disjoint line segments admits a binary tree
+Normal rank
@@ Property / cites work @@
+Planar segment visibility graphs
@@ Property / cites work: Planar segment visibility graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An Output-Sensitive Algorithm for Computing Visibility Graphs
+Normal rank
@@ Property / cites work @@
+VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
+Normal rank
@@ Property / cites work @@
+Hamiltonian triangulations and circumscribing polygons of disjoint line segments
+Normal rank
@@ Property / cites work @@
+Q4401015
@@ Property / cites work: Q4401015 / rank @@
+Normal rank
@@ Property / cites work @@
+Two segment classes with Hamiltonian visibility graphs
+Normal rank
@@ Property / cites work @@
+Minimal tangent visibility graphs
@@ Property / cites work: Minimal tangent visibility graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Topologically sweeping visibility complexes via pseudotriangulations
+Normal rank
@@ Property / cites work @@
+Computing Simple Circuits from a Set of Line Segments is NP-Complete
+Normal rank
@@ Property / cites work @@
+Computing simple circuits from a set of line segments
+Normal rank
@@ Property / cites work @@
+A tight lower bound on the size of visibility graphs
+Normal rank
@@ Property / cites work @@
+On a counterexample to a conjecture of Mirzaian
@@ Property / cites work: On a counterexample to a conjecture of Mirzaian / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank