Pages that link to "Item:Q3088272"
From MaRDI portal
The following pages link to Data Reduction for Graph Coloring Problems (Q3088272):
Displaying 8 items.
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- On the hardness of losing width (Q2441542) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
