scientific article; zbMATH DE number 2209737
From MaRDI portal
Publication:5692720
zbMath1104.68545MaRDI QIDQ5692720
Publication date: 28 September 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs ⋮ Opposite-quadrant depth in the plane ⋮ Coloring points with respect to squares ⋮ Graph unique-maximum and conflict-free colorings ⋮ Conflict-free coloring of intersection graphs of geometric objects ⋮ 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 ⋮ Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs ⋮ Conflict-free connection of trees ⋮ Conflict-free coloring of unit disks ⋮ Ordered Coloring Grids and Related Graphs
This page was built for publication:
