Two segment classes with Hamiltonian visibility graphs
From MaRDI portal
Recommendations
- Segment endpoint visibility graphs are Hamiltonian
- scientific article; zbMATH DE number 5239029
- Two New Classes of Hamiltonian Graphs
- Publication:4206770
- scientific article; zbMATH DE number 5846142
- 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
Cites work
Cited in
(9)- A necessary condition for a graph to be the visibility graph of a simple polygon
- On the visibility graph of convex translates
- Circumscribing polygons and polygonizations for disjoint line segments
- Alternating paths along axis-parallel segments
- scientific article; zbMATH DE number 7559209 (Why is no real title available?)
- The visibility graph of congruent discs is Hamiltonian
- Segment endpoint visibility graphs are Hamiltonian
- Disproving a conjecture on planar visibility graphs
- 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)