Pages that link to "Item:Q3508576"
From MaRDI portal
The following pages link to Obtaining a Planar Graph by Vertex Deletion (Q3508576):
Displaying 15 items.
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- Parameterized graph cleaning problems (Q967382) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- Contracting graphs to paths and trees (Q2441588) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- On Linear Recognition of Tree-Width at Most Four (Q4875439) (← links)
- Parameterized Graph Cleaning Problems (Q5302063) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- Parameterized complexity of vertex splitting to pathwidth at most 1 (Q6639742) (← links)