Pages that link to "Item:Q1786593"

The following pages link to Parameterized algorithms for conflict-free colorings of graphs (Q1786593):

Displaying 3 items.

• Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
• Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
• A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)