Pages that link to "Item:Q2316611"
From MaRDI portal
The following pages link to Partitioning a graph into small pieces with applications to path transversal (Q2316611):
Displaying 9 items.
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- Approximation algorithms for hitting subgraphs (Q2115875) (← links)
- Component order connectivity in directed graphs (Q2165039) (← links)
- (Q5091191) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- Approximating the discrete time-cost tradeoff problem with bounded depth (Q5925637) (← links)
- Component order connectivity in directed graphs (Q6068236) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
