Pages that link to "Item:Q2486082"
From MaRDI portal
The following pages link to Non-stretchable pseudo-visibility graphs (Q2486082):
Displayed 6 items.
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- Non-stretchable pseudo-visibility graphs (Q2486082) (← links)
- A Characterization of Visibility Graphs for Pseudo-polygons (Q3452822) (← links)
- Visibility Graphs of Anchor Polygons (Q5084702) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)