Conflict-Free Colorings of Rectangles Ranges
From MaRDI portal
Publication:5449804
Recommendations
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
- scientific article; zbMATH DE number 2209737
- Dynamic conflict-free colorings in the plane
- Dynamic conflict-free colorings in the plane
Cited in
(17)- Conflict-free coloring of intersection graphs
- Dynamic Offline Conflict-Free Coloring for Unit Disks
- Ordered coloring grids and related graphs
- Dynamic conflict-free colorings in the plane
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Conflict-free coloring of intersection graphs
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
- Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
- On conflict-free connection of graphs
- scientific article; zbMATH DE number 2209737 (Why is no real title available?)
- Conflict-free connection of trees
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
- Dynamic conflict-free colorings in the plane
- Conflict-free coloring of graphs
- Graph unique-maximum and conflict-free colorings
This page was built for publication: Conflict-Free Colorings of Rectangles Ranges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449804)
