scientific article; zbMATH DE number 7559209
From MaRDI portal
DOI10.4230/LIPIcs.SoCG.2019.9MaRDI QIDQ5088936
Diane L. Souvaine, Hugo A. Akitaya, Mikhail Rudoy, Matias Korman, Csaba D. Tóth
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Circumscribing polygons and polygonizations for disjoint line segments, Augmenting Geometric Graphs with Matchings
Cites Work
- Computing simple circuits from a set of line segments
- Bounded-degree polyhedronization of point sets
- Hamiltonian properties of polyhedra with few 3-cuts. A survey
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments
- On a counterexample to a conjecture of Mirzaian
- Two segment classes with Hamiltonian visibility graphs
- On circumscribing polygons for line segments
- Segment endpoint visibility graphs are Hamiltonian
- A theorem on graphs
- Lower bounds on the number of crossing-free subgraphs of \(K_N\)
- Disjoint compatible geometric matchings
- Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique
- On polyhedra induced by point sets in space
- Plane Geometric Graph Augmentation: A Generic Perspective
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- Shooting Permanent Rays among Disjoint Polygons in the Plane
- The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
- The Planar Hamiltonian Circuit Problem is NP-Complete
- A Ramsey-Type Result for Convex Sets
- Embedding planar graphs at fixed vertex locations
