Pages that link to "Item:Q3630207"
From MaRDI portal
The following pages link to Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207):
Displaying 11 items.
- Kernelization using structural parameters on sparse graph classes (Q340583) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring (Q533417) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- On digraph coloring problems and treewidth duality (Q2427534) (← links)
- Data Reduction for Graph Coloring Problems (Q3088272) (← links)
- Planar Capacitated Dominating Set Is W[1]-Hard (Q3656850) (← links)