Pages that link to "Item:Q5918286"
From MaRDI portal
The following pages link to Fixed-parameter tractability of \((n-k)\) list coloring (Q5918286):
Displaying 12 items.
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579) (← links)
- Some (in)tractable parameterizations of coloring and list-coloring (Q777282) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Saving colors and max coloring: some fixed-parameter tractability results (Q1755584) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- On the tractability of \(( k , i )\)-coloring (Q2235289) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- Approximating List-Coloring on a Fixed Surface (Q3521930) (← links)
- A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings (Q4973886) (← links)
- Parameterized complexity of optimizing list vertex-coloring through reconfiguration (Q6091170) (← links)