Pages that link to "Item:Q2022631"
From MaRDI portal
The following pages link to Conflict-free coloring of string graphs (Q2022631):
Displaying 5 items.
- Coloring non-crossing strings (Q727171) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- On tangencies among planar curves with an application to coloring L-shapes (Q6604683) (← links)
- On tangencies among planar curves with an application to coloring L-shapes (Q6612513) (← links)