Colouring polygon visibility graphs and their generalizations
From MaRDI portal
Cites work
- A linear time algorithm for minimum link paths inside a simple polygon
- A note on visibility graphs
- Chromatic number of ordered graphs with forbidden ordered subgraphs
- Coloring curves that cross a fixed curve
- Computing the maximum clique in the visibility graph of a simple polygon
- Die Teilung der projektiven Ebene durch Gerade oder Pseudogerade.
- Extending drawings of graphs to arrangements of pseudolines
- Graph Drawing
- scientific article; zbMATH DE number 1759472 (Why is no real title available?)
- Improved bounds for the conflict-free chromatic art gallery problem
- Induced subgraphs of graphs with large chromatic number. VI. Banana trees
- Max point-tolerance graphs
- Non-stretchable pseudo-visibility graphs
- On a Coloring Problem.
- On characterizing terrain visibility graphs
- On conflict-free chromatic guarding of simple polygons
- On recognizing and characterizing visibility graphs of simple polygons
- On the chromatic number of disjointness graphs of curves
- On the chromatic number of multiple interval graphs and overlap graphs
- On the chromatic number of the visibility graph of a set of points in the plane
- Outerstring graphs are -bounded
- Recognition and complexity of point visibility graphs
- Terrain visibility graphs: persistence is not enough
- Triangle-free intersection graphs of line segments with large chromatic number
- Unsolved problems in visibility graphs of points, segments, and polygons
- Visibility graphs and oriented matroids
- Visibility graphs of point sets in the plane
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
This page was built for publication: Colouring polygon visibility graphs and their generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234086)
