Pages that link to "Item:Q1200910"
From MaRDI portal
The following pages link to Hamiltonian triangulations and circumscribing polygons of disjoint line segments (Q1200910):
Displaying 17 items.
- Graham triangulations and triangulations with a center are Hamiltonean (Q835054) (← links)
- Compatible geometric matchings (Q924079) (← links)
- On a counterexample to a conjecture of Mirzaian (Q1200912) (← links)
- Two segment classes with Hamiltonian visibility graphs (Q1334612) (← links)
- On circumscribing polygons for line segments (Q1388139) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\) (Q1602691) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Non-Hamiltonian triangulations with distant separating triangles (Q1752660) (← links)
- The visibility graph of congruent discs is Hamiltonian (Q1873692) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Circumscribing polygons and polygonizations for disjoint line segments (Q2671176) (← links)
- Hamiltonian-connectedness of triangulations with few separating triangles (Q3299370) (← links)
- (Q5088936) (← links)
- On hamiltonian triangulations in simple polygons (Extended Abstract) (Q5096949) (← links)
- On the visibility graph of convex translates (Q5951963) (← links)
- On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane (Q5951972) (← links)
