Q5088936 (Q5088936): Difference between revisions

@@ Property / cites work @@
+On polyhedra induced by point sets in space
@@ Property / cites work: On polyhedra induced by point sets in space / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-degree polyhedronization of point sets
@@ Property / cites work: Bounded-degree polyhedronization of point sets / rank @@
+Normal rank
@@ Property / cites work @@
+The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
+Normal rank
@@ Property / cites work @@
+The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
+Normal rank
@@ Property / cites work @@
+Lower bounds on the number of crossing-free subgraphs of \(K_N\)
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Segment endpoint visibility graphs are Hamiltonian
+Normal rank
@@ Property / cites work @@
+Plane Geometric Graph Augmentation: A Generic Perspective
+Normal rank
@@ Property / cites work @@
+Disjoint compatible geometric matchings
@@ Property / cites work: Disjoint compatible geometric matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Shooting Permanent Rays among Disjoint Polygons in the Plane
+Normal rank
@@ Property / cites work @@
+A Ramsey-Type Result for Convex Sets
@@ Property / cites work: A Ramsey-Type Result for Convex Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian triangulations and circumscribing polygons of disjoint line segments
+Normal rank
@@ Property / cites work @@
+Two segment classes with Hamiltonian visibility graphs
+Normal rank
@@ Property / cites work @@
+Hamiltonian properties of polyhedra with few 3-cuts. A survey
+Normal rank
@@ Property / cites work @@
+On circumscribing polygons for line segments
@@ Property / cites work: On circumscribing polygons for line segments / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding planar graphs at fixed vertex locations
@@ Property / cites work: Embedding planar graphs at fixed vertex locations / rank @@
+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 @@
+Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
+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 @@
+A theorem on graphs
@@ Property / cites work: A theorem on graphs / rank @@
+Normal rank