Pages that link to "Item:Q452451"
From MaRDI portal
The following pages link to Conflict-free coloring of points on a line with respect to a set of intervals (Q452451):
Displaying 7 items.
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- On Conflict-Free Multi-coloring (Q3449809) (← links)
- Convex partial transversals of planar regions (Q5091044) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
