Pages that link to "Item:Q2656339"
From MaRDI portal
The following pages link to Algorithms for deletion problems on split graphs (Q2656339):
Displaying 6 items.
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms (Q1941715) (← links)
- Faster parameterized algorithms for deletion to split graphs (Q2350905) (← links)
- Deletion graph problems based on deadlock resolution (Q2412401) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5919400) (← links)
- Deletion to scattered graph classes. II: Improved FPT algorithms for deletion to pairs of graph classes (Q6098156) (← links)