Pages that link to "Item:Q5920506"
From MaRDI portal
The following pages link to Visibility graphs of point sets in the plane (Q5920506):
Displaying 17 items.
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- On three measures of non-convexity (Q522338) (← links)
- On the connectivity of visibility graphs (Q715001) (← links)
- Visibility and intersection problems in plane geometry (Q910213) (← links)
- Computing the full visibility graph of a set of line segments (Q1198072) (← links)
- Visible shorelines containing at least \(k\) vertices (Q1587841) (← links)
- Computational complexity aspects of point visibility graphs (Q1720342) (← links)
- On colouring point visibility graphs (Q2201772) (← links)
- Some results on point visibility graphs (Q2339447) (← links)
- Finite sets as complements of finite unions of convex sets (Q2391197) (← links)
- On the chromatic number of the visibility graph of a set of points in the plane (Q2572584) (← links)
- DISTANCE VISIBILITY GRAPHS (Q3136225) (← links)
- On Colourability of Polygon Visibility Graphs (Q5136313) (← links)
- Computing the visibility graph of points within a polygon (Q5361651) (← links)
- Recognition and Complexity of Point Visibility Graphs (Q5368684) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- On colourability of polygon visibility graphs (Q6181985) (← links)