Pages that link to "Item:Q2022631"

The following pages link to Conflict-free coloring of string graphs (Q2022631):

Displaying 2 items.

• 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)