Pages that link to "Item:Q484316"

The following pages link to Complexity of conflict-free colorings of graphs (Q484316):

Displayed 12 items.

• Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) ‎ (← links)
• Parameterized algorithms for conflict-free colorings of graphs (Q1786593) ‎ (← links)
• Conflict-free coloring of string graphs (Q2022631) ‎ (← links)
• Conflict-free coloring of intersection graphs of geometric objects (Q2207603) ‎ (← links)
• Evangelism in Social Networks (Q2819494) ‎ (← links)
• Conflict-Free Coloring of Graphs (Q4556952) ‎ (← links)
• Conflict-Free Coloring of Intersection Graphs (Q4557736) ‎ (← links)
• Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) ‎ (← links)
• (Q5009484) ‎ (← links)
• A Short Note on Open-Neighborhood Conflict-Free Colorings of Graphs (Q5128500) ‎ (← links)
• (Q5136250) ‎ (← links)
• Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) ‎ (← links)