Pages that link to "Item:Q2572584"
From MaRDI portal
The following pages link to On the chromatic number of the visibility graph of a set of points in the plane (Q2572584):
Displaying 15 items.
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Every large point set contains many collinear points or an empty pentagon (Q659671) (← links)
- On the connectivity of visibility graphs (Q715001) (← links)
- Computational complexity aspects of point visibility graphs (Q1720342) (← links)
- Preface: CALDAM 2017 (Q2201762) (← links)
- On colouring point visibility graphs (Q2201772) (← links)
- Some results on point visibility graphs (Q2339447) (← links)
- Blocking visibility for points in general position (Q2391198) (← links)
- Point Visibility Graph Recognition is NP-Hard (Q2809312) (← links)
- Compact Grid Representation of Graphs (Q4899275) (← links)
- On Colourability of Polygon Visibility Graphs (Q5136313) (← links)
- Visibility graphs of point sets in the plane (Q5920506) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- On colourability of polygon visibility graphs (Q6181985) (← links)
- Edge colorings avoiding patterns (Q6181991) (← links)
