The following pages link to (Q5692720):
Displaying 14 items.
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- Coloring half-planes and bottomless rectangles (Q452449) (← links)
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Graph unique-maximum and conflict-free colorings (Q635736) (← links)
- Conflict-free coloring of unit disks (Q1028125) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Opposite-quadrant depth in the plane (Q2373438) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs (Q2891368) (← links)
- Ordered Coloring Grids and Related Graphs (Q3408158) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
