Pages that link to "Item:Q2285090"
From MaRDI portal
The following pages link to Parameterized complexity of conflict-free graph coloring (Q2285090):
Displaying 9 items.
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs (Q6582374) (← links)