Pages that link to "Item:Q4959657"
From MaRDI portal
The following pages link to Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657):
Displaying 7 items.
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← 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)
- Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071) (← links)
- On odd colorings of planar graphs (Q6080172) (← links)