Two segment classes with Hamiltonian visibility graphs
DOI10.1016/0925-7721(94)90019-1zbMATH Open0809.52005OpenAlexW2031282410WikidataQ127939630 ScholiaQ127939630MaRDI QIDQ1334612FDOQ1334612
Authors: Joseph O'Rourke, Jennifer Rippel 
Publication date: 25 September 1994
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(94)90019-1
Recommendations
- Segment endpoint visibility graphs are Hamiltonian
- scientific article; zbMATH DE number 5239029
- Two New Classes of Hamiltonian Graphs
- Publication:4206770
- scientific article
- scientific article; zbMATH DE number 1161243
- The visibility graph of congruent discs is Hamiltonian
- Two edge-disjoint Hamiltonian cycles in graphs
- Two theorems on Hamiltonian graphs
- Publication:4888104
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Cites Work
Cited In (9)
- On the visibility graph of convex translates
- A necessary condition for a graph to be the visibility graph of a simple polygon
- Circumscribing polygons and polygonizations for disjoint line segments
- Alternating paths along axis-parallel segments
- Title not available (Why is that?)
- The visibility graph of congruent discs is Hamiltonian
- Disproving a conjecture on planar visibility graphs
- Segment endpoint visibility graphs are Hamiltonian
- On circumscribing polygons for line segments
This page was built for publication: Two segment classes with Hamiltonian visibility graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334612)
