Pages that link to "Item:Q2319638"
From MaRDI portal
The following pages link to Deleting vertices to graphs of bounded genus (Q2319638):
Displaying 13 items.
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Approximation Algorithms for Euler Genus and Related Problems (Q4581910) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5115795) (← links)
- Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- (Q5874521) (← links)
- (Q5874546) (← links)
- Embedding graphs into two-dimensional simplicial complexes (Q5881549) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
- Recognizing map graphs of bounded treewidth (Q6182682) (← links)
- Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion (Q6670351) (← links)