Pages that link to "Item:Q5136250"
From MaRDI portal
The following pages link to Conflict-free coloring of intersection graphs (Q5136250):
Displaying 9 items.
- Conflict-free coloring of points on a line with respect to a set of intervals (Q452451) (← links)
- Conflict-free coloring of unit disks (Q1028125) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Approximation algorithms for geometric conflict free covering problems (Q2206716) (← links)
- Conflict-free coloring of intersection graphs of geometric objects (Q2207603) (← links)
- Coloring intersection hypergraphs of pseudo-disks (Q5115820) (← links)
- Choice of the control variables of an isolated intersection by graph colouring (Q5278837) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)