Toughness and Delaunay triangulations (Q803161): Difference between revisions

@@ Property / cites work @@
+Q3767380
@@ Property / cites work: Q3767380 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Dirichlet tesselations
@@ Property / cites work: Recognizing Dirichlet tesselations / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Dirichlet tesselations
@@ Property / cites work: Generalized Dirichlet tesselations / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits on 3-polytopes
@@ Property / cites work: Hamiltonian circuits on 3-polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q3866156
@@ Property / cites work: Q3866156 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Voronoi diagrams from convex hulls
@@ Property / cites work: Voronoi diagrams from convex hulls / rank @@
+Normal rank
@@ Property / cites work @@
+On the average length of Delaunay triangulations
@@ Property / cites work: On the average length of Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3689218
@@ Property / cites work: Q3689218 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5573028
@@ Property / cites work: Q5573028 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4713090
@@ Property / cites work: Q4713090 / rank @@
+Normal rank
@@ Property / cites work @@
+On sorting triangles in a Delaunay tessellation
@@ Property / cites work: On sorting triangles in a Delaunay tessellation / rank @@
+Normal rank
@@ Property / cites work @@
+Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
+Normal rank
@@ Property / cites work @@
+A non-Hamiltonian, nondegenerate Delaunay triangulation
+Normal rank
@@ Property / cites work @@
+An upper bound on the shortness exponent of inscribable polytopes
+Normal rank
@@ Property / cites work @@
+An upper bound on the shortness exponent of 1-tough, maximal planar graphs
+Normal rank
@@ Property / cites work @@
+Realizability of Delaunay triangulations
@@ Property / cites work: Realizability of Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Delaunay graphs are almost as good as complete graphs
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Voronoi diagrams and arrangements
@@ Property / cites work: Voronoi diagrams and arrangements / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547252
@@ Property / cites work: Q5547252 / rank @@
+Normal rank
@@ Property / cites work @@
+Some problems on polyhedra
@@ Property / cites work: Some problems on polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Traveling salesman cycles are not always subgraphs of Voronoi duals
+Normal rank
@@ Property / cites work @@
+Q4028874
@@ Property / cites work: Q4028874 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Delaunay and optimal triangulations
@@ Property / cites work: A note on Delaunay and optimal triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy and Delaunay triangulations are not bad in the average case
+Normal rank
@@ Property / cites work @@
+Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
+Normal rank
@@ Property / cites work @@
+Some problems in computational geometry
@@ Property / cites work: Some problems in computational geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q5809022
@@ Property / cites work: Q5809022 / rank @@
+Normal rank
@@ Property / cites work @@
+A 1-tough nonhamiltonian maximal planar graph
@@ Property / cites work: A 1-tough nonhamiltonian maximal planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5528475
@@ Property / cites work: Q5528475 / rank @@
+Normal rank
@@ Property / cites work @@
+Connect-the-dots: A new heuristic
@@ Property / cites work: Connect-the-dots: A new heuristic / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+The Factorization of Linear Graphs
@@ Property / cites work: The Factorization of Linear Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A theorem on graphs
@@ Property / cites work: A theorem on graphs / rank @@
+Normal rank