Pages that link to "Item:Q5089238"
From MaRDI portal
The following pages link to Elimination Distance to Bounded Degree on Planar Graphs (Q5089238):
Displaying 10 items.
- Distance from triviality 2.0: hybrid parameterizations (Q2169932) (← links)
- FPT algorithms to compute the elimination distance to bipartite graphs and more (Q2672425) (← links)
- Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree (Q2946014) (← links)
- A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs (Q5071096) (← links)
- Block elimination distance (Q5918777) (← links)
- Block elimination distance (Q5925550) (← links)
- Combing a Linkage in an Annulus (Q6057804) (← links)
- On the Parameterized Complexity of Clique Elimination Distance (Q6068235) (← links)
- Elimination distance to bounded degree on planar graphs preprint (Q6593702) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)