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