Conflict-free coloring of points and simple regions in the plane

DOI10.1007/s00454-005-1162-6zbMath1066.05064OpenAlexW1974867378MaRDI QIDQ2486862

Sariel Har-Peled, Shakhar Smorodinsky

Publication date: 17 August 2005

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-005-1162-6

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Coloring of graphs and hypergraphs (05C15)

Related Items (40)

Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ⋮ Dynamic conflict-free colorings in the plane ⋮ On Conflict-Free Multi-coloring ⋮ Opposite-quadrant depth in the plane ⋮ Conflict-Free Colourings of Uniform Hypergraphs With Few Edges ⋮ Coloring Axis-Parallel Rectangles ⋮ Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Coloring planar homothets and three-dimensional hypergraphs ⋮ Coloring points with respect to squares ⋮ Coloring lines and Delaunay graphs with respect to boxes ⋮ Graph unique-maximum and conflict-free colorings ⋮ A procedure for computing the symmetric difference of regions defined by polygonal curves ⋮ Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors ⋮ Coloring half-planes and bottomless rectangles ⋮ Conflict-free coloring of points on a line with respect to a set of intervals ⋮ On conflict-free connection of graphs ⋮ Complexity of conflict-free colorings of graphs ⋮ Conflict-Free Colourings of Graphs and Hypergraphs ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs ⋮ Online Conflict-Free Colouring for Hypergraphs ⋮ Conflict-free coloring of string graphs ⋮ Coloring axis-parallel rectangles ⋮ Dynamic Offline Conflict-Free Coloring for Unit Disks ⋮ CONFLICT-FREE COLORINGS OF SHALLOW DISCS ⋮ Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ Parameterized Complexity of Conflict-Free Graph Coloring ⋮ Conflict-free connection of trees ⋮ Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces ⋮ Convex partial transversals of planar regions ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points ⋮ Unnamed Item ⋮ Improved Ramsey-type results for comparability graphs ⋮ ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS ⋮ Ordered Coloring Grids and Related Graphs ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points. ⋮ Dynamic Conflict-Free Colorings in the Plane ⋮ Some results on strong conflict-free connection number of graphs

This page was built for publication: Conflict-free coloring of points and simple regions in the plane