Pages that link to "Item:Q677018"
From MaRDI portal
The following pages link to On recognizing and characterizing visibility graphs of simple polygons (Q677018):
Displaying 17 items.
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- A note on the combinatorial structure of the visibility graph in simple polygons (Q673765) (← links)
- Visibility graphs of towers (Q676570) (← links)
- The vertex-edge visibility graph of a polygon (Q1388137) (← links)
- A necessary condition for a graph to be the visibility graph of a simple polygon (Q1605320) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Negative results on characterizing visibility graphs (Q1900990) (← links)
- Determining bar-representability for ordered weighted graphs (Q1917046) (← 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)
- (Q4945520) (← links)
- Visibility Graphs of Anchor Polygons (Q5084702) (← links)
- Clique-width of point configurations (Q5918571) (← links)
- Disproving a conjecture on planar visibility graphs (Q5941094) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- On half guarding polygons (Q6606194) (← links)
