Pages that link to "Item:Q2207603"
From MaRDI portal
The following pages link to Conflict-free coloring of intersection graphs of geometric objects (Q2207603):
Displaying 20 items.
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Coloring the complements of intersection graphs of geometric figures (Q941403) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q2207604) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces (Q2309464) (← links)
- Conflict-free coloring of points and simple regions in the plane (Q2486862) (← links)
- Conflict-Free Coloring of Intersection Graphs (Q4557736) (← links)
- (Q4608049) (redirect page) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q5115820) (← links)
- Conflict-free coloring of intersection graphs (Q5136250) (← links)
- Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points (Q5234040) (← links)
- On conflict-free coloring of points and simple regions in the plane (Q5361612) (← links)
- Conflict‐free chromatic number versus conflict‐free chromatic index (Q6057644) (← links)
- Exactly hittable interval graphs (Q6599815) (← links)
- Conflict-free colouring of subsets (Q6624182) (← links)
