Pages that link to "Item:Q803161"
From MaRDI portal
The following pages link to Toughness and Delaunay triangulations (Q803161):
Displaying 27 items.
- Triangulations without minimum-weight drawing (Q294766) (← links)
- Disjoint empty disks supported by a point set (Q375386) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- An upper bound on the shortness exponent of 1-tough, maximal planar graphs (Q805630) (← links)
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties (Q904106) (← links)
- Matching points with rectangles and squares (Q955221) (← links)
- Matching points with squares (Q1006403) (← links)
- Simpler proof of a realizability theorem on Delaunay triangulations (Q1327308) (← links)
- Graph-theoretical conditions for inscribability and Delaunay realizability (Q1356410) (← links)
- Maximum and minimum toughness of graphs of small genus (Q1356471) (← links)
- Strong matching of points with geometric shapes (Q1699290) (← links)
- Voronoi drawings of trees (Q1869748) (← links)
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete (Q1917249) (← links)
- Approximate proximity drawings (Q1947972) (← links)
- Affine invariant triangulations (Q2065637) (← links)
- Matchings in higher-order Gabriel graphs (Q2355704) (← links)
- 2-change for k-connected networks (Q2638954) (← links)
- (Q2728899) (← links)
- Six Topics on Inscribable Polytopes (Q2832782) (← links)
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces (Q3057631) (← links)
- ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS (Q3405973) (← links)
- A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere (Q4020141) (← links)
- A simple method for resolving degeneracies in Delaunay triangulations (Q4630259) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- Hamiltonicity for convex shape Delaunay and Gabriel graphs (Q5918982) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)
- Matchings in 1‐planar graphs with large minimum degree (Q6056806) (← links)
