The following pages link to Wheel-Free Deletion Is W[2]-Hard (Q3503585):
Displayed 7 items.
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)