Pages that link to "Item:Q450579"
From MaRDI portal
The following pages link to On the parameterized complexity of coloring graphs in the absence of a linear forest (Q450579):
Displaying 8 items.
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Some (in)tractable parameterizations of coloring and list-coloring (Q777282) (← links)
- Parameterizing role coloring on forests (Q831825) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- List coloring in the absence of a linear forest (Q2258070) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- Ruling out FPT algorithms for weighted coloring on forests (Q5916046) (← links)