Conflict-Free Colorings of Rectangles Ranges

DOI10.1007/11672142_20zbMath1136.68567OpenAlexW1553380098MaRDI QIDQ5449804

Nabil H. Mustafa, Khaled M. Elbassioni

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11672142_20

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (11)

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ⋮ Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Graph unique-maximum and conflict-free colorings ⋮ Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors ⋮ On conflict-free connection of graphs ⋮ Dynamic Offline Conflict-Free Coloring for Unit Disks ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ Conflict-free connection of trees ⋮ Unnamed Item ⋮ Ordered Coloring Grids and Related Graphs

This page was built for publication: Conflict-Free Colorings of Rectangles Ranges