Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106): Difference between revisions

@@ Property / author @@
-Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
-Normal rank
@@ Property / author @@
+Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.comgeo.2015.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2757769355
@@ Property / OpenAlex ID: W2757769355 / rank @@
+Normal rank
@@ Property / cites work @@
+ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
+Normal rank
@@ Property / cites work @@
+Blocking Delaunay triangulations
@@ Property / cites work: Blocking Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Witness Gabriel graphs
@@ Property / cites work: Witness Gabriel graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-orientation equilateral triangle matching of point sets
+Normal rank
@@ Property / cites work @@
+Q3258698
@@ Property / cites work: Q3258698 / rank @@
+Normal rank
@@ Property / cites work @@
+Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
+Normal rank
@@ Property / cites work @@
+On the stretch factor of convex Delaunay graphs
@@ Property / cites work: On the stretch factor of convex Delaunay graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
+Normal rank
@@ Property / cites work @@
+‐relative neighborhood graphs are hamiltonian
@@ Property / cites work: 20‐relative neighborhood graphs are hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
+Normal rank
@@ Property / cites work @@
+Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graph
+Normal rank
@@ Property / cites work @@
+A non-Hamiltonian, nondegenerate Delaunay triangulation
+Normal rank
@@ Property / cites work @@
+Toughness and Delaunay triangulations
@@ Property / cites work: Toughness and Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for two bottleneck optimization problems
+Normal rank
@@ Property / cites work @@
+-Gabriel graphs are Hamiltonian
@@ Property / cites work: 10-Gabriel graphs are Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024777
@@ Property / cites work: Q3024777 / rank @@
+Normal rank
@@ Property / cites work @@
+The Factorization of Linear Graphs
@@ Property / cites work: The Factorization of Linear Graphs / rank @@
+Normal rank