Pages that link to "Item:Q2429328"
From MaRDI portal
The following pages link to Obtaining a planar graph by vertex deletion (Q2429328):
Displayed 9 items.
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- Proper interval vertex deletion (Q1949742) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- A faster FPT algorithm for bipartite contraction (Q2445333) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)