Pages that link to "Item:Q2466015"
From MaRDI portal
The following pages link to Computing the maximum clique in the visibility graph of a simple polygon (Q2466015):
Displaying 6 items.
- Can visibility graphs be represented compactly? (Q1338961) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- (Q5111878) (← links)
- On Colourability of Polygon Visibility Graphs (Q5136313) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- On colourability of polygon visibility graphs (Q6181985) (← links)