Pages that link to "Item:Q534566"
From MaRDI portal
The following pages link to Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566):
Displaying 8 items.
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Data reduction for graph coloring problems (Q393081) (← links)
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Parameterizing by the number of numbers (Q692894) (← links)
- Finding vertex-surjective graph homomorphisms (Q715053) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- On directed covering and domination problems (Q1735678) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
