Pages that link to "Item:Q3088287"
From MaRDI portal
The following pages link to Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287):
Displaying 11 items.
- Proper interval vertex deletion (Q1949742) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- On the complexity of singly connected vertex deletion (Q2089067) (← 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)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- GlobaL analysis of the deiete-contract recursion for graphs and matroids (Q3320394) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)
